Monotonic semantic interpretation, Proceedings of the 30th annual meeting on Association for Computational Linguistics -, pp.32-39, 1992. ,
DOI : 10.3115/981967.981972
A first-order axiomatization of the theory of finite trees, Journal of Logic, Language and Information, vol.18, issue.4, pp.5-39, 1995. ,
DOI : 10.1007/BF01048403
Beta Reduction Constraints, Proc. 12th Rewriting Techniques and Applications, 2001. ,
DOI : 10.1007/3-540-45127-7_5
URL : https://hal.archives-ouvertes.fr/inria-00536804
Underspecified beta reduction . Submitted Available at http://www.ps.uni-sb, 2001. ,
URL : https://hal.archives-ouvertes.fr/inria-00536805
Predicate logic unplugged, Proceedings of the 10th Amsterdam Colloquium, pp.133-143, 1996. ,
Completion of rewrite systems with membership constraints, Coll. on Automata, Languages and Programming, 1992. ,
DOI : 10.1007/3-540-55719-9_91
Minimal Recursion Semantics. An Introduction. Manuscript, 1997. ,
DOI : 10.1007/s11168-006-6327-9
On determining the consistency of partial descriptions of trees, Proceedings of the 32nd annual meeting on Association for Computational Linguistics -, pp.163-170, 1994. ,
DOI : 10.3115/981732.981755
Ellipsis and quantification, Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics -, pp.229-236, 1995. ,
DOI : 10.3115/976973.977006
Ellipsis and higher-order unification, Linguistics and Philosophy, vol.8, issue.1, pp.399-452, 1991. ,
DOI : 10.1007/BF00630923
A model-eliminative treatment of quantifier-free tree descriptions, Algebraic Methods in Language Processing, pp.55-66, 2000. ,
A constraint-based treatment of descriptions, Proceedings of IWCS-3, 1999. ,
Dominance Constraints with Set Operators, Proceedings of the First International Conference on Computational Logic (CL2000), 2000. ,
DOI : 10.1007/3-540-44957-4_22
URL : https://hal.archives-ouvertes.fr/inria-00536806
Constraints over Lambda-Structures in Semantic Underspecification, Proceedings COLING/ACL'98, 1998. ,
URL : https://hal.archives-ouvertes.fr/inria-00536807
Reinterpretation by Underspecification, 2000. ,
Reinterpretation from a synchronic and a diachronic point of view Meaning Change -Meaning Variation, number 106 in Arbeitspapier der FG Sprachwissenschaft, 2000. ,
The constraint language for lambda structures, Journal of Logic, Language, and Information, 2001. ,
URL : https://hal.archives-ouvertes.fr/inria-00536795
Constraints over lambda-structures in semantic underspecification, Proceedings of the 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COL- ING/ACL'98), pp.353-359, 1998. ,
URL : https://hal.archives-ouvertes.fr/inria-00536807
Parallelism Constraints, International Conference on Rewriting Techniques and Applications, 2000. ,
DOI : 10.1007/10721975_8
URL : https://hal.archives-ouvertes.fr/inria-00536808
Higher-Order Coloured Unification and natural language semantics, Proceedings of the 34th annual meeting on Association for Computational Linguistics -, 1996. ,
DOI : 10.3115/981863.981864
Describing discourse semantics, Proceedings of the 4th TAG+ Workshop, 1998. ,
VP deletion and across the board quantifier scope, 1982. ,
A discourse copying algorithm for ellipsis and anaphora resolution, Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics -, 1993. ,
DOI : 10.3115/976744.976769
Interpreting Cohesive Forms in the Context of Discourse Inference, 1995. ,
Evaluating context unification for semantic underspecification, Proceedings of the Third ESSLLI Student Session, pp.188-199, 1998. ,
A polynomial-time fragment of dominance constraints, Proceedings of the 38th Annual Meeting on Association for Computational Linguistics , ACL '00, 2000. ,
DOI : 10.3115/1075218.1075265
URL : https://hal.archives-ouvertes.fr/inria-00536809
On underspecified processing of dynamic semantics, Proceedings of the 18th conference on Computational linguistics -, 2000. ,
DOI : 10.3115/990820.990887
URL : https://hal.archives-ouvertes.fr/inria-00536810
Relaxing underspecified semantic representations for reinterpretation. Grammars, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00536811
Dominance Constraints: Algorithms and Complexity, Proceedings of the Third Conference on Logical Aspects of Computational Linguistics, 1998. ,
DOI : 10.1007/3-540-45738-0_7
URL : https://hal.archives-ouvertes.fr/inria-00536812
Linear second-order unification, International Conference on Rewriting Techniques and Applications, 1996. ,
DOI : 10.1007/3-540-61464-8_63
Linear second-order unification and context unification with treeregular constraints, International Conference on Rewriting Techniques and Applications, 2000. ,
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP, Mathematics of the USSR-Sbornik, vol.32, issue.2, 1977. ,
DOI : 10.1070/SM1977v032n02ABEH002376
D-theory: Talking about talking about trees, Proceedings of the 21st ACL, pp.129-136, 1983. ,
Programming with Constraints, 1998. ,
The LEDA Platform of Combinatorial and Geometric Computing, 1999. ,
The proper treatment of quantification in ordinary English, Formal Philosophy. Selected Papers of Richard Montague, 1974. ,
Order-Independence and Underspecification, Ellipsis, Underspecification , Events and More in Dynamic Semantics. DYANA Deliverable R.2.2.C, 1995. ,
On equality up-to constraints over finite trees, context unification, and one-step rewriting, Proceedings 14th CADE, 1997. ,
DOI : 10.1007/3-540-63104-6_4
URL : https://hal.archives-ouvertes.fr/inria-00536822
A uniform approach to underspecification and parallelism, Proceedings ACL'97, pp.410-417, 1997. ,
URL : https://hal.archives-ouvertes.fr/inria-00536821
Dominance Constraints in Context Unification, Proceedings of the Third Conference on Logical Aspects of Computational Linguistics, 1998. ,
DOI : 10.1007/3-540-45738-0_12
URL : https://hal.archives-ouvertes.fr/inria-00536820
On rewrite constraints and context unification, Information Processing Letters, vol.74, issue.1-2, pp.25-40, 2000. ,
DOI : 10.1016/S0020-0190(00)00036-3
URL : https://hal.archives-ouvertes.fr/inria-00536802
The Mozart Programming System web pages, 1999. ,
Radical underspecification, Proceedings of the 10th Amsterdam Colloquium, pp.587-606, 1996. ,
On underspecification, Proceedings of the 5th International Workshop on Computational Semantics, 1999. ,
D-tree grammars, Proceedings of the 33rd annual meeting on Association for Computational Linguistics -, 1995. ,
DOI : 10.3115/981658.981679
Dealing with Ambiguities by Underspecification: Construction, Representation and Deduction, Journal of Semantics, vol.10, issue.2, pp.123-179, 1993. ,
DOI : 10.1093/jos/10.2.123
The Oz Programming Model, Computer Science Today, pp.324-343, 1995. ,
Using descriptions of trees in a tree adjoining grammar, Computational Linguistics, vol.18, pp.481-518, 1992. ,
Parsing D-Tree Grammars, Proceedings of the Intl. Workshop on Parsing Technologies, 1995. ,