A. V. Aho, M. R. Garey, and J. D. Ullman, The Transitive Reduction of a Directed Graph, SIAM Journal on Computing, vol.1, issue.2, pp.131-137, 1972.
DOI : 10.1137/0201008

E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren et al., An efficient algorithm for the configuration problem of dominance graphs. Submit- ted, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00536803

R. Backofen, J. Rogers, and K. Vijay-shanker, 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

J. Bos, Predicate logic unplugged, Proceedings of the 10th Amsterdam Colloquium, 1996.

A. Copestake, D. Flickinger, and I. Sag, Minimal Recursion Semantics. An In- troduction. Manuscript, 1997.
DOI : 10.1007/s11168-006-6327-9

D. Duchier and C. Gardent, A constraint-based treatment of descriptions, Proceedings of IWCS-3, 1999.

D. Duchier and S. Thater, Parsing with tree descriptions: a constraint-based approach, Proc. NLULP'99, 1999.

M. Egg, J. Niehren, P. Ruhrberg, and F. Xu, Constraints over Lambda-Structures in Semantic Underspecification, Proceedings COLING/ACL'98, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00536807

Z. Galil, S. Micali, and H. N. Gabow, An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs, SIAM Journal on Computing, vol.15, issue.1, pp.120-130, 1986.
DOI : 10.1137/0215009

C. Gardent and B. Webber, Describing discourse semantics, Proceedings of the 4th TAG+ Workshop, 1998.

J. R. Hobbs and S. M. Shieber, An algorithm for generating quantifier scopings, Computational Linguistics, vol.13, pp.47-63, 1987.

A. Koller, J. Niehren, and R. Treinen, Dominance Constraints: Algorithms and Complexity, Proceedings of the 3rd LACL, 1998.
DOI : 10.1007/3-540-45738-0_7
URL : https://hal.archives-ouvertes.fr/inria-00536812

M. P. Marcus, D. Hindle, and M. M. Fleck, D-theory, Proceedings of the 21st annual meeting on Association for Computational Linguistics -, 1983.
DOI : 10.3115/981311.981337

R. A. Muskens, Order-independence and underspecification, Ellipsis, Underspecification, Events and More in Dynamic Semantics. DYANA Deliverable R.2.2.C, 1995.

G. Perrier, From intuitionistic proof nets to interaction grammars, Proceedings of the 5th TAG+ Workshop, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00098793

O. Rambow, K. Vijay-shanker, and D. Weir, D-tree grammars, Proceedings of the 33rd annual meeting on Association for Computational Linguistics -, pp.151-158, 1995.
DOI : 10.3115/981658.981679

J. Rogers and K. Vijay-shanker, OBTAINING TREES FROM THEIR DESCRIPTIONS: AN APPLICATION TO TREE-ADJOINING GRAMMARS, Computational Intelligence, vol.18, issue.4, pp.401-421, 1994.
DOI : 10.1111/j.1467-8640.1994.tb00005.x

K. Vijay-shanker, Using descriptions of trees in a tree adjoining grammar, Computational Linguistics, vol.18, pp.481-518, 1992.

A. Willis and S. Manandhar, Two accounts of scope availability and semantic underspecification, Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -, 1999.
DOI : 10.3115/1034678.1034727