A New Algorithm for Normal Dominance Constraints

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 59-67

  Bodirsky, Manuel ^a   Duchier, Denys ^b   Niehren, Joachim ^c   Miele, Sebastian ^d  

^a HUMBOLDT UNIVERSITY   (Germany)

^b LORIA   (France)

^c UNIV LILLE   (France)

^d SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; SEMANTICS; SET THEORY; TREES (MATHEMATICS);

HEAD DRIVEN PHRASE STRUCTURE GRAMMAR (HPSG); MINIMAL RECURSION SEMANTICS (MRS); NORMAL DOMINANCE CONSTRAINTS;

COMPUTER SCIENCE;

EID: 1842421163     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, and S. Thiel. An efficient graph algorithm for dominance constraints. Journal of Algorithms, 48(1):194-219, May 2003. Special Issue of SODA 2001.
2. R. Backofen, J. Rogers, and K. Vijay-Shanker. A first-order axiomatization of the theory of finite trees. Journal of Logic, Language, and Information, 4:5-39, 1995.
3. M. Bodirsky and M. Kutz. Pure dominance constraints. In 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS'02), LNCS 2285, pages 287-298, 2002.
4. J. Bos. Predicate logic unplugged. In Proceedings of the 10th Amsterdam Colloquium, pages 133-143, 1996.
5. A. Copestake, D. Flickinger, I. Sag, and C. Pollard. Minimal recursion semantics: An introduction. CSLI Draft, Sept. 1999.
6. M. Egg, A. Koller, and J. Niehren. The constraint language for lambda structures. Journal of Logic, Language, and Information, 10:457-485, 2001.
7. C. Gardent and B. Webber. Describing discourse semantics. In Proceedings of the 4th TAG+ Workshop, Philadelphia, 1998. University of Pennsylvania.
8. J. Holm., K. de Lichtenberg, and M. Thorup. Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In 30th Annu. ACM Sympos. Theory Comput., pages 79-89, 1998.
9. A. Koller, J. Niehren, and R. Treinen. Dominance constraints: Algorithms and complexity. In Logical Aspects of Computational Linguistics, volume 2014 of LNAI, pages 106-125, 2001.
10. st Annu. Meeting of the Ass. of Comp. Ling., pages 129-136, 1983.
11. J. Niehren and S. Thater. Bridging the gap between underspecification formalisms: Minimal recursion semantics as dominance constraints. In 41st Meeting of the Association of Computational Linguistics, pages 367-374, July 2003.
12. J. Rogers and K. Vijay-Shanker. Obtaining trees from their descriptions: An application to tree-adjoining grammars. Computational Intelligence, 10:401-421, 1994.
13. S. Thiel. A linear time algorithm for the configuration problem of dominance graphs. Submitted, 2004. Max-Planck Institut, Saarbrücken.