E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren et al., An efficient graph algorithm for dominance constraints, Journal of Algorithms, vol.48, issue.1, pp.194-219, 2001.
DOI : 10.1016/S0196-6774(03)00050-6
URL : https://hal.archives-ouvertes.fr/inria-00536539

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

M. Bodirsky and M. Kutz, Pure Dominance Constraints, 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS'02), pp.287-298, 2002.
DOI : 10.1007/3-540-45841-7_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.2619

J. Bos, Predicate logic unplugged, Proceedings of the 10th Amsterdam Colloquium, pp.133-143, 1996.

A. Copestake, D. Flickinger, I. Sag, and C. Pollard, Minimal recursion semantics: An introduction. CSLI Draft, 1999.

M. Egg, A. Koller, and J. Niehren, The constraint language for lambda structures, Journal of Logic, Language and Information, vol.10, issue.4, pp.457-485, 2001.
DOI : 10.1023/A:1017964622902
URL : https://hal.archives-ouvertes.fr/inria-00536795

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

J. Holm, K. De-lichtenberg, and M. Thorup, Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, 30th Annu, pp.79-89, 1998.

A. Koller, J. Niehren, and R. Treinen, Dominance Constraints: Algorithms and Complexity, Logical Aspects of Computational Linguistics, pp.106-125, 2001.
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 -, pp.129-136, 1983.
DOI : 10.3115/981311.981337

J. Niehren and S. Thater, Bridging the gap between underspecification formalisms, Proceedings of the 41st Annual Meeting on Association for Computational Linguistics , ACL '03, pp.367-374, 2003.
DOI : 10.3115/1075096.1075143
URL : https://hal.archives-ouvertes.fr/inria-00536542

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

S. Thiel, A linear time algorithm for the configuration problem of dominance graphs, 2004.