Martin Müller

Affiliations:
  • Universität des Saarlandes, Saarbrücken, Germany


According to our database1, Martin Müller authored at least 15 papers between 1992 and 2001.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2001
The first-order theory of ordering constraints over feature trees.
Discret. Math. Theor. Comput. Sci., 2001

2000
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic.
Inf. Comput., 2000

Ordering Constraints over Feature Trees.
Constraints An Int. J., 2000

1999
Entailment of Atomic Set Constraints is PSPACE-Complete.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs.
Proceedings of the Programming Languages and Systems, 1999

1997
Inclusion Constraints over Non-empty Sets of Trees.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1996
Oz: nebenläufige Programmierung mit Constraints.
Künstliche Intell., 1996

1995
Weak subsumption Constraints for Type Diagnosis: An Incremental Algorithm
CoRR, 1995

Constraints for Free in Concurrent Computing.
Proceedings of the First International Workshop on Concurrent Constraint Programming, 1995

Constraints for Free in Concurrent Computation.
Proceedings of the Algorithms, 1995

1994
The Stable Semantics and its Variants: A Comparison of Recent Approaches.
Proceedings of the KI-94: Advances in Artificial Intelligence, 1994

Partial Evaluation and Relevance for Approximations of Stable Semantics.
Proceedings of the Methodologies for Intelligent Systems, 8th International Symposium, 1994

An Axiomatic Approach to Semantics of Disjunctive Programs.
Proceedings of the Logic Programming, 1994

1993
Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties (Extended Abstract).
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1993

1992
Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs.
Proceedings of the Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992


  Loading...