Publications

Home Publications Research Teaching

2005

  1. Modular grammar design with typed parametric principles
    Ralph Debusmann, Denys Duchier, Andreas Rossberg, FG-MOL 2005, August 2005.
  2. Biomolecular agents as multi-behavioural concurrent objects [slides]
    Denys Duchier, Céline Kuttler. MTCoord 2005, April 2005.
  3. XMG: un compilateur de méta-grammaires extensible
    Denys Duchier, Joseph Leroux, Yannick Parmentier. TALN 2005.

2004

  1. The Metagrammar Compiler: An NLP Application with a Multi-paradigm Architecture
    Denys Duchier, Joseph Leroux, Yannick Parmentier. 2nd International Mozart/Oz Conference Oct 2004.
  2. The XDG Grammar Development Kit
    Ralph Debusmann, Denys Duchier, Joachim Niehren. 2nd International Mozart/Oz Conference Oct 2004.
  3. Metagrammar Redux
    Benoit Crabbé, Denys Duchier. Constraint Solving and Language Processing Sep 2004.
  4. Multi-dimensional Graph Configuration for Natural Language Processing
    Ralph Debusmann, Denys Duchier, Marco Kuhlmann, Constraint Solving and Language Processing Sep 2004.
  5. Extensible Dependency Grammar: A New Methodology
    Ralph Debusmann, Denys Duchier, Geert-Jan Kruijff. Recent Advances in Dependency Grammar, COLING 2004, August 2004.
  6. A Relational Syntax-Semantics Interface Based on Dependency Grammar
    Ralph Debusmann, Denys Duchier, Alexander Koller, Marco Kuhlmann, Gert Smolka, Stefan Thater. COLING 2004, August 2004.
  7. TAG Parsing as Model Enumeration
    Ralph Debusmann, Denys Duchier, Marco Kuhlmann, Stefan Thater. TAG+7, May 2004.
  8. A New Algorithm For Normal Dominance Constraints
    Manuel Bodirsky, Denys Duchier, Joachim Niehren. Symposium on Discrete Algorithmns, SODA04, Jan 2004.

2003

  1. Configuration Of Labeled Trees Under Lexicalized Constraints And Principles
    Denys Duchier. Journal of Research on Language and Computation, Sep 2003.
  2. Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment
    Denys Duchier. Journal of Theoretical Computer Science, Feb 2003.
  3. Logic programming in the context of multiparadigm programming: the Oz experience
    Peter Van Roy, Per Brand, Denys Duchier, Seif Haridi, Martin Henz, Christian Schulte. Theory and Practice of Logic Programming, Nov 2003.
  4. An efficient graph algorithm for dominance constraints
    Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel. Journal of Algorithms, May 2003.
  5. Information Structure in Topological Dependency Grammar
    Geert-Jan Kruijff, Denys Duchier. EACL 2003.
  6. An Efficient Algorithm for Weakly Normal Dominance Constraints
    Manuel Bodirsky, Denys Duchier, Joachim Niehren Sebastian Miele (submitted)
  7. Towards a Syntax-Semantics Interface for Topological Dependency Grammar
    Denys Duchier, Denys Duchier. (submitted).

2002

  1. Topological Dependency Analysis of the Dutch Verb Cluster
    Denys Duchier, Ralph Debusmann (research report)
  2. An Efficient Graph Algorithm for Dominance Constraints
    Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel. to appear in the Special Issue of SODA 2001.
  3. Formal and Computational Aspects of Dependency Grammar
    Geert-Jan Kruijff, Denys Duchier. Lecture Notes, ESSLLI 2002, Trento, Italy, August 2002.

2001

  1. Lexicalized Syntax and Topology for Non-projective Dependency Grammar
    Denys Duchier. Joint Conference on Formal Grammars and Mathematics of Language FGMOL-01, Helsinki, August 2001.
  2. Topological Dependency Trees: A Constraint-based Account of Linear Precedence
    Denys Duchier, Ralph Debusmann. 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), Toulouse, France, July 9-11 2001.
  3. Tree Descriptions, Constraints and Incrementality
    Denys Duchier, Claire Gardent. In Computing Meaning, Volume 2 (Harry Bunt, Reinhard Muskens, Elias Thijsse Eds.), Studies In Linguistics And Philosophy, pages 205-227, December 2001. Kluwer Academic Publishers.
  4. An Efficient Algorithm for the Configuration Problem of Dominance Graphs
    Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel. Twelfth ACM-SIAM Symposium of Discrete Algorithms, Washington, DC, January 7-9 2001.

2000

  1. Constraint Programming For Natural Language Processing
    Denys Duchier. Lecture Notes, ESSLLI 2000, Birmingham, UK, August 2000.
  2. A Model-Eliminative Treatment of Quantifier-free Tree Descriptions
    Denys Duchier. In Algebraic Methods in Language Processing (D. Heylen, A. Nijholt, G. Scollo Eds), 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
  3. Dominance Constraints with Set Operators
    Denys Duchier, Joachim Niehren. Proceedings of the First International Conference on Computational Logic (CL2000), LNCS, July 2000. Springer

1999

  1. Parsing with Tree Descriptions: a constraint-based approach
    Denys Duchier, Stefan Thater. Sixth International Workshop on Natural Language Understanding and Logic Programming (NLULP'99), pages 17-32, Las Cruces, New Mexico, December 1999.
  2. Axiomatizing Dependency Parsing Using Set Constraints
    Denys Duchier. Sixth Meeting on Mathematics of Language, pages 115-126, Orlando, Florida, July 1999.
  3. Set Constraints in Computational Linguistics -- Solving Tree Descriptions
    Denys Duchier. Workshop on Declarative Programming with Sets (DPS'99), pages 91-98, Paris, France, September 1999.
  4. A Constraint-Based Treatment of Descriptions
    Denys Duchier, Claire Gardent. Third International Workshop on Computational Semantics (IWCS-3), (H.C. Bunt, E.G.C. Thijsse Eds), pages 71-85, Tilburg, NL, January 1999.

1998

  1. Mozart/Oz Documentation
    Mozart Consortium, 1998-2001.
  2. Concurrent constraint programming in Oz for natural language processing
    Denys Duchier, Claire Gardent, Joachim Niehren. Course material, Universität des Saarlandes, Germany, 1998-2001.
  3. A Higher-order Module Discipline with Separate Compilation, Dynamic Linking, and Pickling
    Denys Ducheir, Leif Kornstaedt, Christian Schulte, Gert Smolka. Technical Report, Programming Systems Lab, DFKI and Universität des Saarlandes, 1998.

1996

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

1995

  1. Compiling The Typed Polymorphic Label Selective Lambda Calculus
    Denys Duchier. ISG Research Report, Simon Fraser University, Canada, May 1995.
  2. Reconciling Finite Domains and Constrained Sorts
    Denys Duchier. ISG Research Note, Simon Fraser University, Canada, October 1995.
  3. CLP Techniques for Channel Routing
    Denys Duchier, Serge Le Huitouze. ISG Research Report, Simon Fraser University, Canada, November 1995.
  4. Generic Constraint-driven Configuration System Proposal
    Denys Duchier, Hassan Aït-Kaci. ISG Internal Report, Simon Fraser University, Canada, June 1995.

1993

  1. Data-structures
    Robert Holte, Denys Duchier. Course material, IGIP & University of Ottawa, Canada, 1993.
  2. Spreading Computation
    Denys Duchier. Research Note, University of Ottawa, Canada, June 1993.
  3. Software Reuse and the GUIDAR Project
    Denys Duchier. Internal Research Note, University of Ottawa, Canada, March 1993.
  4. Concrete Browsing of a Graphical Toolkit Library
    Denys Duchier. 5th IEEE International Conference on Tools with AI, Boston, November 8-11 1993.

1992

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

1991

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

1988

  1. The LogiCalc Manual
    Denys Duchier. Technical Report YALEU/DCS/RR#660, Yale University, USA, August 1988.
  2. LogiCalc: an Environment for Interactive Proof Development
    Denys Duchier. 9th International Conference on Automated Deduction (CADE), May 1988.