A polynomial-time fragment of dominance constraints

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 2000-October, Issue , 2000, Pages

  Koller, Alexander ^a   Mehlhorn, Kurt ^b   Niehren, Joachim ^a  

^a SAARLAND UNIVERSITY   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; POLYNOMIAL APPROXIMATION;

DETERMINISTICS; NP COMPLETE; POLYNOMIAL-TIME; SATISFIABILITY PROBLEMS;

COMPUTATIONAL LINGUISTICS;

EID: 0041708690     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. A. V. Aho, M. R. Garey, and J. D. Ullman. 1972. The transitive reduction of a directed graph. SIAM Journal of Computing, 1:131-137.
2. E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, and S. Thiel. 2000. An efficient algorithm for the configuration problem of dominance graphs. Submitted. http://www.ps.uni-sb.de/Papers/abstracts/dom-graph.html.
3. R. Backofen, J. Rogers, and K. Vijay-Shanker. 1995. A first-order axiomatization of the theory of finite trees. Journal of Logic, Language, and Information, 4:5-39.
4. Johan Bos. 1996. Predicate logic unplugged. In Proceedings of the 10th Amsterdam Colloquium.
5. A. Copestake, D. Flickinger, and I. Sag. 1997. Minimal Recursion Semantics. An Introduction. Manuscript, ftp://csli-ftp. stanford.edu/linguistics/sag/mrs.ps.gz.
6. Denys Duchier and Claire Gardent. 1999. A constraint-based treatment of descriptions. In Proceedings of IWCS-3, Tilburg.
7. D. Duchier and S. Thater. 1999. Parsing with tree descriptions: a constraint-based approach. In Proc. NLULP'99, Las Cruces, New Mexico.
8. M. Egg, J. Niehren, P. Ruhrberg, and F. Xu. 1998. Constraints over Lambda-Structures in Semantic Underspecification. In Proceedings COLING/ACL'98, Montreal.
9. Z. Galil, S. Micali, and H. N. Gabow. 1986. An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM Journal of Computing, 15:120-130.
10. Claire Gardent and Bonnie Webber. 1998. Describing discourse semantics. In Proceedings of the 4th TAG+ Workshop, Philadelphia.
11. Jerry R. Hobbs and Stuart M. Shieber. 1987. An algorithm for generating quantifier scopings. Computational Linguistics, 13:47-63.
12. A. Koller, J. Niehren, and R. Treinen. 1998. Dominance constraints: Algorithms and complexity. In Proceedings of the 3rd LACL, Grenoble. To appear as LNCS.
13. M. P. Marcus, D. Hindle, and M. M. Fleck. 1983. D-theory: Talking about talking about trees. In Proceedings of the 21st ACL.
14. K. Mehlhorn and S. Naher. 1999. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge. See also http://www.mpi-sb. mpg.de/LEDA/.
15. R.A. Muskens. 1995. Order-independence and underspecification. In J. Groenendijk, editor, Ellipsis, Underspecification, Events and More in Dynamic Semantics. DYANA Deliverable R.2.2.C.
16. Guy Perrier. 2000. From intuitionistic proof nets to interaction grammars. In Proceedings of the 5th TAG+ Workshop, Paris.
17. O. Rambow, K. Vijay-Shanker, and D. Weir. 1995. D-Tree grammars. In Proceedings of the 33rd ACL, pages 151-158.
18. J. Rogers and K. Vijay-Shanker. 1994. Obtaining trees from their descriptions: An application to tree-adjoining grammars. Computational Intelligence, 10:401-421.
19. K. Vijay-Shanker. 1992. Using descriptions of trees in a tree adjoining grammar. Computational Linguistics, 18:481-518.
20. A. Willis and S. Manandhar. 1999. Two accounts of scope availability and semantic underspecification. In Proceedings of the 37th ACL.