Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, and Sven Thiel. An efficient algorithm for the dominance problem. Submitted, 2000.


P. Blackburn, C. Gardent, and W. Meyer-Viol. Talking about trees. In Proceedings of EACL'93, Utrecht, 1993.


Johan Bos. Predicate logic unplugged. In Proceedings of the 10th Amsterdam Colloquium, pages 133-143, 1996.


Ralf Backofen, James Rogers, and K. Vijay-Shankar. A first-order axiomatisation of the theory of finite trees. Journal of Logic, Language and Information, 1995.


Tom Cornell. On Determinning the Consistency of Partial Descriptions of Trees. In Proceedings of ACL'94, pages 129-136, 1994.


Jochen Dörre and Andreas Eisele. Feature logic with disjunctive unification. In COLING-90, volume 2, pages 100-105, 1990.


Denys Duchier and Claire Gardent. A constraint-based treatment of descriptions. In H.C. Bunt and E.G.C. Thijsse, editors, Third International Workshop on Computational Semantics (IWCS-3), pages 71-85, Tilburg, NL, January 1999.


Denys Duchier, Leif Kornstaedt, Tobias Müller, Christian Schulte, and Peter Van Roy. System Modules. Mozart Consortium, 1999.


Denys Duchier, Leif Kornstaedt, and Christian Schulte. Application Programming. Mozart Consortium, 1999.


Denys Duchier, Leif Kornstaedt, and Christian Schulte. The Oz Base Environment. Mozart Consortium, 1999. z.


Denys Duchier and Joachim Niehren. Dominance constraints with set operators. In Proceedings of the First International Conference on Computational Logic (CL2000), LNCS. Springer, July 2000.


Denys Duchier and Stefan Thater. Parsing with tree descriptions: a constraint-based approach. In Sixth International Workshop on Natural Language Understanding and Logic Programming (NLULP'99), pages 17-32, Las Cruces, New Mexico, December 1999.


Denys Duchier. Axiomatizing dependency parsing using set constraints. In Sixth Meeting on Mathematics of Language, pages 115-126, Orlando, Florida, July 1999.


Denys Duchier. Set constraints in computational linguistics -- solving tree descriptions. In Workshop on Declarative Programming with Sets (DPS'99), pages 91-98, September 1999.


Denys Duchier. A model-eliminative treatment of quantifier-free tree descriptions. In D. Heylen, A. Nijholt, and G. Scollo, editors, Algebraic Methods in Language Processing, AMILP 2000, TWLT 16, Twente Workshop on Language Technology (2nd AMAST Workshop on Language Processing), pages 55-66, Iowa City, USA, May 2000. Universiteit Twente, Faculteit Informatica.


Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahamane Aggoun, Thomas Graf, and F. Berthier. The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems FGCS-88, pages 693-702, Tokyo, Japan, December 1988.


M. Egg and K. Lebeth. Semantic underspecification and modifier attachment ambiguities. In J. Kilbury and R. Wiese, editors, Integrative Ansätze in der Computerlinguistik (DGfS/CL '95), pages 19-24. Seminar für Allgemeine Sprachwissenschaft, Düsseldorf, 1995.


Markus Egg, Joachim Niehren, Peter Ruhrberg, and Feiyu Xu. Constraints over lambda-structures in semantic underspecification. In Proceedings of the 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING/ACL'98), pages 353-359, Montreal, Canada, August 1998.


Dale Gerdemann. Parsing and Generation of Unification Grammars. PhD thesis, University of Illinois, 1991.


Carmen Gervet. Set Intervals in Constraint-Logic Programming: Definition and Implementation of a Language}. PhD thesis, Université de France-Compté, September 1995. European Thesis.


John Griffith. Modularizing contexted constraints. In COLING-96, 1990.


Martin Henz. Don't be puzzled! In Proceedings of the Workshop on Constraint Programming Applications, in conjunction with the Second International Conference on Principles and Practice of Constraint Programming (CP96), Cambridge, Massachusetts, USA, August 1996.


Martin Henz. Objects for Concurrent Constraint Programming, volume 426 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, November 1997.


Martin Henz. Objects in Oz. PhD thesis, Universit\"at des Saarlandes, Fachbereich Informatik, Saarbr\"ucken, Germany, June 1997.


Seif Haridi and Nils Franzén. The Oz Tutorial. Mozart Consortium, 1999.


Randall A. Helzerman and Mary P. Harper. MUSE CSP: An extension to the constraint satisfaction problem. Journal of Artificial Intelligence Research, 1, 1993.


Mary P. Harper, Stephen A. Hockema, and Christopher M. White. Enhanced constraint dependency grammar parsers. In Proceedings of the IASTED International Conference on Artificial Intelligence and Soft Computing, Honolulu, Hawai USA, August 1999.


Johannes Heinecke, Jürgen Kunze, Wolfgang Menzel, and Ingo Schröder. Eliminative parsing with graded constraints. In Proceedings of the Joint Conference COLING-ACL, pages 526-530, 1998.


Sverker Janson. AKL - A Multiparadigm Programming Language. Sics dissertation series 14, uppsala theses in computing science 19, Uppsala University, June 1994.


Alexander Koller and Joachim Niehren. Scope underspecification and processing. Reader for the European Summer School on Logic Language and Information., July 21 1999.


Alexander Koller, Joachim Niehren, and Ralf Treinen. Dominance constraints: Algorithms and complexity. In Proceedings of the Third Conference on Logical Aspects of Computational Linguistics, Grenoble, 1998.


M.P. Marcus. Deterministic parsing and description theory. In P. Whitelock, M.M. Wood, H.L. Somers, R. Johnson, and P. Bennett, editors, Linguistic Theory and Computer Applications. Academic Press, 1987.


Hiroshi Maruyama. Constraint dependency grammar. Research Report RT0044, IBM Research, Tokyo, March 1990.


Wolfgang Menzel. Constraint satisfaction for robust parsing of spoken language. Journal of Experimental and Theoretical Artificial Intelligence, 10(1):77-89, 1998.


M.P.Marcus, D. Hindle, and M.M.Fleck. Talking about talking about trees. In Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics, Cambridge, MA, 1983.


John T. Maxwell and Ronald M. Kaplan. An overview of disjunctive constraint satisfaction. In Proceedings of the Internation Workshop on Parsing Technologies, pages 18-27, 1989.


R.A. Muskens and E. Krahmer. Description Theory, LTAGs and Underspecified Semantics. In Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, pages 112-115, Philadelphia, PA, 1998. Institute for Research in Cognitive Science.


Tobias Müller. Problem Solving with Finite Set Constraints in Oz. Mozart Consortium, 1999. ps.gz.


Tobias Müller and Martin Müller. Finite set constraints in Oz. In Fran\ccois Bry, Burkhard Freitag, and Dietmar Seipel, editors, 13. Workshop Logische Programmierung, pages 104-115, Technische Universität München, 17--19 September 1997.


Martin Müller, Tobias Müller, and Peter Van Roy. Multi-paradigm programming in Oz. In Donald Smith, Olivier Ridoux, and Peter Van Roy, editors, Visions for the Future of Logic Programming: Laying the Foundations for a Modern successor of Prolog}, Portland, Oregon, 7 December 1995. A Workshop in Association with ILPS'95.


Richard Montague. The proper treatment of quantification in ordinary English. In R. Thomason, editor, Formal Philosophy. Selected Papers of Richard Montague. Yale University Press, New Haven, 1974.


Wolfgang Menzel and Ingo Schröder. Decision procedures for dependency parsing using graded constraints. In Proceedings of the COLING-ACL98 Workshop ``Processing of Dependency-based Grammars'', 1998.


Tobias Müller. Solving set partitioning problems with constraint programming. In Proceedings of the Sixth International Conference on the Practical Application of Prolog and the Forth International Conference on the Practical Application of Constraint Technology -- PAPPACT98, pages 313-332, London, UK, March 1998. The Practical Application Company Ltd.


J. Niehren, M. Pinkal, and P. Ruhrberg. A uniform approach to underspecification and parallelism. In Proceedings ACL'97, pages 410-417, Madrid, 1997.


Konstantin Popov. The Oz Browser. Mozart Consortium, 1999.


Mike Reape. Domain union and word order variation in german. In John Nerbonne, Klaus Netter, and Carl Pollard, editors, German in Head-Driven Phrase Structure Grammar, number 46. CSLI Publications, 1994.


James Rogers and K. Vijay-Shanker. Reasoning with descriptions of trees, 1992.


J. Rogers and K. Vijay-Shanker. Obtaining trees from their descriptions: An application to tree-adjoining grammars. Computational Intelligence, 10:401-421, 1994.


Owen Rambow, K. Vijay-Shanker, and David Weir. D--Tree Grammars. In Proceedings of ACL'95, 1995.


Owen Rambow, K. Vijay-Shanker, and David Weir. D-tree grammars. In Proceedings of ACL'95, pages 151-158, MIT, Cambridge, 1995.


Christian Schulte. Oz Explorer: A visual constraint programming tool. In Lee Naish, editor, Proceedings of the Fourteenth International Conference on Logic Programming, pages 286-300, Leuven, Belgium, July 1997. The MIT Press.


Christian Schulte. Programming constraint inference engines. In Gert Smolka, editor, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, volume 1330 of Lecture Notes in Computer Science, pages 519-533, Schlo\ss Hagenberg, Austria, October 1997. Springer-Verlag.


Christian Schulte. Oz Explorer - Visual Constraint Programming Support. Mozart Consortium, 1999.


Christian Schulte. Programming deep concurrent constraint combinators. In Enrico Pontelli and Vítor Santos Costa, editors, Practical Aspects of Declarative Languages, Second International Workshop, PADL 2000, volume 1753 of Lecture Notes in Computer Science, pages 215-229, Boston, MA, USA, January 2000. Springer-Verlag.


Gert Smolka. A calculus for higher-order concurrent constraint programming with deep guards. Research Report RR-94-03, Deutsches Forschungszentrum f\"ur K\"unstliche Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, February 1994.


Gert Smolka. A foundation for higher-order concurrent constraint programming. In Jean Pierre Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, vol. 845, pages 50-72, München, Germany, 7--9 September 1994. Springer-Verlag.


Gert Smolka. The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol. 1000, pages 324-343. Springer-Verlag, Berlin, 1995.


Gert Smolka. Problem solving with constraints and programming. ACM Computing Surveys, 28(4es), December 1996. Electronic Section.


Vijay A. Saraswat, Martin Rinard, and Prakash Panangaden. Semantic foundations of concurrent constraint programming. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 333-352, Orlando, Florida, January 21--23, 1991. ACM SIGACT-SIGPLAN, ACM Press. Preliminary report.


Christian Schulte and Gert Smolka. Encapsulated search in higher-order concurrent constraint programming. In Maurice Bruynooghe, editor, Logic Programming: Proceedings of the 1994 International Symposium, pages 505-520, Ithaca, New York, USA, November 1994. MIT-Press.


Christian Schulte and Gert Smolka. Finite Domain Constraint Programming in Oz. Mozart Consortium, 1999.


Christian Schulte, Gert Smolka, and J\"org W\"urtz. Encapsulated search and constraint programming in Oz. In A.H. Borning, editor, Second Workshop on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 874, pages 134-150, Orcas Island, Washington, USA, May 1994. Springer-Verlag.


K. Vijay-Shankar. Using descriptions of trees in a tree-adjoining grammar. Computational Linguistics, (18):481-518, 1992.

Denys Duchier
Version 1.2.0 (20010221)