2001 |
20 | EE | Martin Müller,
Joachim Niehren,
Ralf Treinen:
The first-order theory of ordering constraints over feature trees.
Discrete Mathematics & Theoretical Computer Science 4(2): 193-234 (2001) |
2000 |
19 | | Martin Müller,
Joachim Niehren,
Andreas Podelski:
Ordering Constraints over Feature Trees.
Constraints 5(1/2): 7-41 (2000) |
18 | | Martin Müller,
Joachim Niehren:
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic.
Inf. Comput. 159(1-2): 22-58 (2000) |
17 | | Martin Müller,
Susumu Nishimura:
Type Inference for First-Class Messages with Feature Constraints.
Int. J. Found. Comput. Sci. 11(1): 29-63 (2000) |
1999 |
16 | EE | Andreas Podelski,
Witold Charatonik,
Martin Müller:
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs.
ESOP 1999: 177-192 |
15 | EE | Joachim Niehren,
Martin Müller,
Jean-Marc Talbot:
Entailment of Atomic Set Constraints is PSPACE-Complete.
LICS 1999: 285-294 |
1998 |
14 | EE | Martin Müller,
Susumu Nishimura:
Type Inference for First-Class Messages with Feature Constraints.
ASIAN 1998: 169-187 |
13 | | Martin Müller,
Joachim Niehren,
Ralf Treinen:
The First-Order Theory of Ordering Constraints over Feature Trees.
LICS 1998: 432-443 |
12 | EE | Martin Müller,
Joachim Niehren:
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic.
RTA 1998: 196-210 |
1997 |
11 | | Martin Müller,
Joachim Niehren,
Andreas Podelski:
Ordering Constraints over Feature Trees.
CP 1997: 297-311 |
10 | | Martin Müller,
Joachim Niehren,
Andreas Podelski:
Inclusion Constraints over Non-empty Sets of Trees.
TAPSOFT 1997: 345-356 |
9 | | Tobias Müller,
Martin Müller:
Finite Set Intervals in Oz.
WLP 1997: 17-19 |
1996 |
8 | | Martin Müller,
Gert Smolka:
Oz: nebenläufige Programmierung mit Constraints.
KI 10(3): 55-61 (1996) |
1995 |
7 | | Joachim Niehren,
Martin Müller:
Constraints for Free in Concurrent Computation.
ASIAN 1995: 171-186 |
6 | EE | Martin Müller,
Joachim Niehren:
Weak subsumption Constraints for Type Diagnosis: An Incremental Algorithm
CoRR abs/cmp-lg/9506002: (1995) |
1994 |
5 | | Jürgen Dix,
Martin Müller:
An Axiomatic Approach to Semantics of Disjunctive Programs.
ICLP 1994: 303-320 |
4 | | Jürgen Dix,
Martin Müller:
Partial Evaluation and Relevance for Approximations of Stable Semantics.
ISMIS 1994: 511-520 |
3 | | Jürgen Dix,
Martin Müller:
The Stable Semantics and its Variants: A Comparison of Recent Approaches.
KI 1994: 82-93 |
1993 |
2 | | Martin Müller,
Jürgen Dix:
Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties (Extended Abstract).
LPNMR 1993: 43-59 |
1992 |
1 | | Jürgen Dix,
Martin Müller:
Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs.
Structural Complexity and Recursion-theoretic methods in Logic-Programming 1992: 15-28 |