Publications

2012

  1. Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants. [BIB]
    Maxime Senot, Denys Duchier, Jérôme Durand-Lose. Theory and Applications of Models of Computation (TAMC), Proceedings of the 9th international conference on Theory and Applications of Models of Computation (TAMC 2012), v7287, Beijing, China, 05 2012.

2011

  1. Intégrer des connaissances linguistiques dans un CRF: application à l'apprentissage d'un segmenteur-étiqueteur du français [PDF] [BIB]
    Matthieu Constant, Isabelle Tellier, Denys Duchier, Yoann Dupont, Anthony Sigogne, Sylvie Billot. TALN, 2011.
  2. Cross-framework Grammar Engineering using Constraint-driven Metagrammars [BIB]
    Denys Duchier, Yannick Parmentier, Simon Petitjean. 6th International Workshop on Constraint Solving and Language Processing (CSLP'11), Karlsruhe, Germany, 09 2011.
  3. Model-Theory of Property Grammars with Features [BIB]
    Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier. 12th International Conference on Parsing Technologies (IWPT 2011), Dublin, Ireland, 10 2011.
  4. Solving Q-SAT in bounded space and time by geometrical computation [BIB]
    Denys Duchier, Jérôme Durand-Lose, Maxime Senot. Models of computability in context, 7th Int. Conf. Computability in Europe, CiE '11 (abstracts and handout booklet), Sofia, Bulgaria, 2011.

2010

  1. Une Modélisation des Grammaires de Propriétés sous forme de Problème de Satisfaction de Contraintes [BIB]
    Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier, Willy Lesaint. 11 2010. (6e Journée Informatique de la Région Centre (JIRC)).
  2. Massively Parallel Automata in Euclidean Space-Time [PDF] [BIB]
    Maxime Senot, Jérôme Durand-Lose, Denys Duchier. First International Workshop on Spatial Computing (SCW '10), Budapest, Hongrie, September 2010.
  3. Une modélisation en CSP des grammaires de propriétés [PDF] [BIB]
    Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier, Willy Lesaint. Sixièmes Journées Francophones de Programmation par Contraintes (JFPC 2010), Caen, France, June 2010.
  4. Construction géométrique pour résoudre SAT en temps constant [BIB]
    Denys Duchier, Jérôme Durand-Lose, Maxime Senot. Blois, France, 01 2010. (Journée Informatique Région Centre (JIRC)).
  5. Fractal parallelism: Solving sat in bounded space and time [PDF] [BIB]
    Denys Duchier, Jérôme Durand-Lose, Maxime Senot. ISAAC '10, Int. Symposium on Algorithms and Computation, December 2010.
  6. Property Grammar Parsing Seen as a Constraint Optimization Problem [PDF] [BIB]
    Denys Duchier, Thi-Bich-Hanh Dao, Yannick Parmentier, Willy Lesaint. Proceedings of the 15th International Conference on Formal Grammar (FG 2010), Copenhagen, Danemark, August 2010.

2009

  1. A model-theoretic framework for grammaticality judgements [PDF] [BIB] [PDF (slides)]
    Denys Duchier, Jean-Philippe Prost, Thi-Bich-Hanh Dao. Conference on Formal Grammar (FG2009), June 2009.
  2. eXtensible MetaGrammar [BIB]
    Benoit Crabbé, Denys Duchier, Claire Gardent, Joseph Le Roux, Yannick Parmentier. Computational Linguistics, 2009. (Submitted).

2006

  1. Biomolecular agents as multi-behavioral concurrent objects [PDF] [BIB]
    Denys Duchier, Céline Kuttler. Electronic Notes in Theoretical Computer Science, v150 n1, March 2006. (journal version of mtcoord2005).

2005

  1. Modular grammar design with typed parametric principles [PDF] [BIB]
    Ralph Debusmann, Denys Duchier, Andreas Rossberg. Formal Grammars and Mathematics of Language, FGMOL05, August 2005.
  2. Biomolecular agents as multi-behavioral concurrent objects [PDF] [BIB]
    Denys Duchier, Céline Kuttler. MTCoord05, April 2005.
  3. XMG: un compilateur de métagrammaires extensible [PDF] [BIB]
    Denys Duchier, Joseph Leroux, Yannick Parmentier. TALN05, June 2005.

2004

  1. Metagrammar Redux [PDF] [BIB]
    Benoit Crabbé, Denys Duchier. Constraint Solving and Language Processing, CSLP04, September 2004.
  2. The XDG Grammar Development Kit [PDF] [BIB]
    Ralph Debusmann, Denys Duchier, Joachim Niehren. Proceedings of the 2nd International Mozart/Oz Conference, MOZ04, October 2004.
  3. A Relational Syntax-Semantics Interface Based on Dependency Grammar [PDF] [BIB]
    Ralph Debusmann, Denys Duchier, Alexander Koller, Marco Kuhlmann, Gert Smolka, Stefan Thater. COLING 2004, Geneva, August 2004.
  4. A New Algorithm for Normal Dominance Constraints [PDF] [BIB]
    Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele. Symposium on Discrete Algorithms, SODA04, January 2004.
  5. Lexicalized Syntax and Topology for Non-projective Dependency Grammar [PDF] [BIB]
    Denys Duchier. Electronic Notes in Theoretical Computer Science, v53, Helsinki, April 2004. (journal version of FGMOL2001).
  6. TAG Parsing as Model Enumeration [PDF] [PS] [BIB]
    Ralph Debusmann, Denys Duchier, Marco Kuhlmann, Stefan Thater. TAG+7, May 2004.
  7. Multi-dimensional Graph Configuration for Natural Language Processing [PDF] [BIB]
    Ralph Debusmann, Denys Duchier, Marco Kuhlmann. Constraint Solving and Language Processing, CSLP04, September 2004.
  8. The Metagrammar Compiler: An NLP Application with a Multi-paradigm Architecture [PDF] [BIB]
    Denys Duchier, Joseph Leroux, Yannick Parmentier. Proceedings of the 2nd International Mozart/Oz Conference, MOZ04, October 2004.
  9. Extensible Dependency Grammar: A New Methodology [PDF] [BIB]
    Ralph Debusmann, Denys Duchier, Geert-Jan Kruijff. Recent Advances in Dependency Grammars, COLING04, Geneva, August 2004.

2003

  1. Logic programming in the context of multiparadigm programming: the Oz experience [PDF] [PS] [BIB]
    Van Roy, Peter, Per Brand, Denys Duchier, Seif Haridi, Martin Henz, Christian Schulte. Theory and Practice of Logic Programming, v3 n6, November 2003.
  2. An Efficient Graph Algorithm for Dominance Constraints [PDF] [BIB]
    Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel. Submitted to the Special Issue of SODA 2001, Journal of Algorithms, May 2003. (Subsumes the papers from ACL 2000 and SODA 2001).
  3. Towards a Syntax-Semantics Interface for Topological Dependency Grammar [PDF] [BIB]
    Denys Duchier, Ralph Debusmann. 2003.
  4. Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment [PDF] [PS] [BIB]
    Denys Duchier. Theoretical Computer Science, v293 n2, February 2003. to appear in the Journal of Theoretical Computer Science (TCS) 2002.
  5. Configuration Of Labeled Trees Under Lexicalized Constraints And Principles [PDF] [PS] [BIB]
    Denys Duchier. Journal of Research on Language and Computation, v1 n3/4, September 2003.
  6. Information Structure in Topological Dependency Grammar [PDF] [BIB]
    Geert-Jan Kruijff, Denys Duchier. Proceedings of EACL 2003, EACL 2003, Budapest, April 2003.
  7. An Efficient Algorithm for Weakly Normal Dominance Constraints [BIB]
    Manuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele. 2003.

2002

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

2001

  1. Topological Dependency Trees: A Constraint-based Account of Linear Precedence [PDF] [BIB]
    Denys Duchier, Ralph Debusmann. 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), Toulouse, France, July 2001.
  2. Tree Descriptions, Constraints and Incrementality [PDF] [PS] [BIB]
    Denys Duchier, Claire Gardent. Computing Meaning, Volume 2, v77, Dordrecht, December 2001.
  3. An Efficient Algorithm for the Configuration Problem of Dominance Graphs [PDF] [PS] [BIB]
    Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, January 2001.
  4. Lexicalized Syntax and Topology for Non-projective Dependency Grammar [PDF] [BIB]
    Denys Duchier. Joint Conference on Formal Grammars and Mathematics of Language FGMOL'01, Helsinki, August 2001.

2000

  1. Constraint Programming For Natural Language Processing [BIB]
    Denys Duchier. August 2000. Lecture Notes, ESSLLI 2000.
  2. A Model-Eliminative Treatment of Quantifier-free Tree Descriptions [PDF] [BIB]
    Denys Duchier. Algebraic Methods in Language Processing, AMILP~2000, TWLT~16, Iowa City, USA, May 2000.
  3. Dominance Constraints with Set Operators [PS] [BIB]
    Denys Duchier, Joachim Niehren. Proceedings of the First International Conference on Computational Logic (CL2000), July 2000.

1999

  1. Axiomatizing Dependency Parsing Using Set Constraints [PDF] [PS] [BIB]
    Denys Duchier. Sixth Meeting on Mathematics of Language, Orlando, Florida, July 1999.
  2. Parsing with Tree Descriptions: a constraint-based approach [PDF] [PS] [BIB]
    Denys Duchier, Stefan Thater. Sixth International Workshop on Natural Language Understanding and Logic Programming (NLULP'99), Las Cruces, New Mexico, December 1999.
  3. Set Constraints in Computational Linguistics -- Solving Tree Descriptions [PDF] [PS] [BIB]
    Denys Duchier. Workshop on Declarative Programming with Sets (DPS'99), Paris, France, September 1999.

1998

  1. Mozart Documentation [BIB]
    1998--2001.
  2. A Higher-order Module Discipline with Separate Compilation, Dynamic Linking, and Pickling [PDF] [PS] [BIB]
    Denys Duchier, Leif Kornstaedt, Christian Schulte, Gert Smolka. 1998. (DRAFT).
  3. Concurrent Constraint Programming in Oz for Natural Language Processing [BIB]
    Denys Duchier, Claire Gardent, Joachim Niehren. 1998. Course given at the Universität des Saarlandes (1999,2000,2001). (Course Material).

1996

  1. Channel Routing with CLP(FD) [PDF] [PS] [BIB]
    Denys Duchier, Serge Le Huitouze. Second International Conference on the Practical Application of Constraint Technology (PACT'96), 1996.

1995

  1. CLP Techniques for Channel Routing [PDF] [PS] [BIB]
    Denys Duchier, Serge Le Huitouze. Canada, November 1995.
  2. Reconciling Finite Domains and Constrained Sorts [PDF] [PS] [BIB]
    Denys Duchier. Canada, October 1995.
  3. Generic Constraint-driven Configuration System Proposal [BIB]
    Denys Duchier, Hassan Aït-Kaci. Canada, June 1995.
  4. Compiling The Typed Polymorphic Label Selective Lambda Calculus [PDF] [PS] [BIB]
    Denys Duchier. Canada, May 1995.

1993

  1. Software Reuse and the GUIDAR Project [BIB]
    Denys Duchier. Canada, March 1993.
  2. Concrete Browsing of a Graphical Toolkit Library [PDF] [PS] [BIB]
    Denys Duchier. 5th IEEE International Conference on Tools with AI (TAI'93), Boston, November 1993.
  3. Data Structures [BIB]
    Robert Holte, Denys Duchier. 1993. Course for the Institute for Government Informatics Professionals (1993). Also given at the University of Ottawa, Canada. (Course Material).
  4. Spreading Computation [BIB]
    Denys Duchier. June 1993.

1992

  1. Reuse And Non-Monotonic Design of User Interfaces [BIB]
    Denys Duchier. nTR-92-17, April 1992.

1991

  1. LogiCalc: an Environment for Interactive Proof Development [BIB]
    Denys Duchier. October 1991.

1988

  1. The LogiCalc Manual [BIB]
    Denys Duchier. nYALEU/DCS/RR#660, August 1988.
  2. LogiCalc: an Environment for Interactive Proof Development [BIB]
    Denys Duchier. 9th International Conference on Automated Deduction (CADE-9), May 1988.
Last updated: 2008-09-01