Denys Duchier
Publications

2002

  1. Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele. An Efficient Algorithm for Weakly Normal Dominance Constraints. Submitted, June 2002.

  2. Denys Duchier, Ralph Debusmann. Topological Dependency Analysis of the Dutch Verb Cluster. Submitted, February 2002.

  3. Ernst Althaus, Denys Duchier, Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel. An Efficient Graph Algorithm for Dominance Constraints. In Submitted to the Special Issue of SODA 2001, 2002.

  4. Denys Duchier. Configuration Of Labeled Trees Under Lexicalized Constraints And Principles. (submitted Dec 2000) To appear in the Journal of Language and Computation, 2002.

  5. Denys Duchier. Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment. (submitted Sep 2000) To appear in the Journal of Theoretical Computer Science, 2002.

2001

  1. Denys Duchier, Claire Gardent. Tree Descriptions, Constraints and Incrementality. In Harry Bunt, Reinhard Muskens, Elias Thijsse, editors, Computing Meaning, Volume 2, Studies In Linguistics And Philosophy, pages 205-227, December 2001. Kluwer Academic Publishers.

  2. Denys Duchier. Lexicalized Syntax and Topology for Non-projective Dependency Grammar. In Joint Conference on Formal Grammars and Mathematics of Language FGMOL-01, Helsinki, August 2001.

  3. Denys Duchier, Ralph Debusmann. Topological Dependency Trees: A Constraint-based Account of Linear Precedence. In 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), Toulouse, France, July 9-11 2001.

  4. Ernst Althaus, Denys Duchier, Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel. An Efficient Algorithm for the Configuration Problem of Dominance Graphs. In Twelfth ACM-SIAM Symposium of Discrete Algorithms, Washington, DC, January 7-9 2001.

2000

  1. Denys Duchier. Constraint Programming For Natural Language Processing. Lecture Notes, ESSLLI 2000, August 2000.

  2. Denys Duchier, Joachim Niehren. Dominance Constraints with Set Operators. In Proceedings of the First International Conference on Computational Logic (CL2000), LNCS, July 2000. Springer.

  3. Denys Duchier. A Model-Eliminative Treatment of Quantifier-free Tree Descriptions. In D. Heylen, A. Nijholt, 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.

1999

  1. Denys Duchier, 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.

  2. Denys Duchier. Set Constraints in Computational Linguistics -- Solving Tree Descriptions. In Workshop on Declarative Programming with Sets (DPS'99), pages 91-98, Paris, France, September 1999.

  3. Denys Duchier. Axiomatizing Dependency Parsing Using Set Constraints. In Sixth Meeting on Mathematics of Language, pages 115-126, Orlando, Florida, July 1999.

  4. Denys Duchier, Claire Gardent. A Constraint-Based Treatment of Descriptions. In H.C. Bunt, E.G.C. Thijsse, editors, Third International Workshop on Computational Semantics (IWCS-3), pages 71-85, Tilburg, NL, January 1999.

1998

  1. Denys Duchier, Claire Gardent, Joachim Niehren. Concurrent constraint programming in Oz for natural language processing. Course material, Universität des Saarlandes, 1998-2001.

  2. Mozart/Oz Documentation. Mozart Consortium, 1998-2001.

  3. Denys Duchier, Leif Kornstaedt, Christian Schulte, Gert Smolka. A Higher-order Module Discipline with Separate Compilation, Dynamic Linking, and Pickling. Technical Report, Programming Systems Lab, DFKI and Universität des Saarlandes, 1998.

1996

  1. Denys Duchier, Serge Le Huitouze. Channel Routing with CLP(FD). In Proceedings of PACT'96, 1996.

1995

  1. Denys Duchier, Serge Le Huitouze. CLP Techniques for Channel Routing. ISG Research Report, Simon Fraser University, November 1995.

  2. Denys Duchier. Reconciling Finite Domains and Constrained Sorts. ISG Research Note, Simon Fraser University, October 1995.

  3. Denys Duchier, Hassan Aït-Kaci. Generic Constraint-driven Configuration System Proposal. ISG Internal Report, Simon Fraser University, June 1995.

  4. Denys Duchier. Compiling The Typed Polymorphic Label Selective Lambda Calculus. ISG Research Report, Simon Fraser University, May 1995.

1993

  1. Denys Duchier. Concrete Browsing of a Graphical Toolkit Library. In 5th IEEE International Conference on Tools with AI, Boston, November 8-11 1993.

  2. Denys Duchier. Spreading Computation. Research Note, University of Ottawa, June 1993.

  3. Denys Duchier. Software Reuse and the GUIDAR Project. Internal Research Note, University of Ottawa, March 1993.

  4. Robert Holte, Denys Duchier. Datastructures. Course material, IGIP & University of Ottawa, 1993.

1992

  1. Denys Duchier. Reuse And Non-Monotonic Design of User Interfaces. Technical Report TR-92-17, University of Ottawa, April 1992.

1991

  1. Denys Duchier. LogiCalc: an Environment for Interactive Proof Development. PhD Thesis, Yale University, October 1991.

1988

  1. Denys Duchier. The LogiCalc Manual. Technical Report YALEU/DCS/RR#660, Yale University, August 1988.

  2. Denys Duchier. LogiCalc: an Environment for Interactive Proof Development. In 9th International Conference on Automated Deduction, May 1988.