Dominance constraints: Algorithms and complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2014, Issue , 2001, Pages 106-125

  Koller, Alexander ^a   Niehren, Joachim ^a   Treinen, Ralf ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Complexity; Computational linguistics; Constraint programming; Dominance constraints; Underspecification

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; PARALLEL PROCESSING SYSTEMS; SEMANTICS; TREES (MATHEMATICS);

ALGORITHMS AND COMPLEXITY; COMPLEXITY; CONCURRENT CONSTRAINT PROGRAMMING; CONSTRAINT PROGRAMMING; DOMINANCE CONSTRAINTS; FIRST ORDER THEORIES; SATISFIABILITY PROBLEMS; UNDERSPECIFICATION;

COMPUTATIONAL COMPLEXITY;

EID: 23044525726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45738-0_7     Document Type: Conference Paper

References (20)

1. Backofen, R., 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.
2. Bos, J. Predicate logic unplugged. In Proceedings of the 10th Amsterdam Colloquium, pages 133-143, 1996.
3. Duchier, D., and C. Gardent. A constraint-based treatment of descriptions. In Proceedings of IWCS-3, Tilburg, 1999.
4. Duchier, D., and J. Niehren. Solving dominance constraints with finite set constraint programming. Technical report, Universität des Saarlandes, Programming Systems Lab, 1999. http://www.ps.uni-sb.de/Papers/abstracts/DomCP99.html.
5. Egg, M., J. Niehren, P. Ruhrberg, and F. Xu. Constraints over Lambda-Structures in Semantic Under specification. In Proceedings COLING/ACL’98, Montreal, 1998.
6. Gardent, C., and B. Webber. Describing discourse semantics. In Proceedings of the 4th TAG+ Workshop, Philadelphia, 1998. University of Pennsylvania.
7. Johnson, D. S. A catalog of complexity classes. In Leeuwen, J. van, editor, Handbook of Theoretical Computer Science, vol A: Algorithms and Complexity, chapter 2, pages 67-161. Elsevier, 1990.
8. Koller, A. Constraint languages for semantic under specification. Diplom thesis, Universität des Saarlandes, Saarbrücken, Germany, 1999. http://www.coli.uni-sb.de/~koller/papers/da.html.
9. Koller, A., and J. Niehren. Constraint programming in computational linguistics. Submitted. http://www.coli.uni-sb.de/~koller/cpcl.html, 1999.
10. Koller, A., and J. Niehren. Scope under specification and processing. Lecture Notes, ESSLLI’99, Utrecht, 1999. http://www.coli.uni-sb.de/~koller/papers/esslli99.html.
11. Marcus, M. P., D. Hindle, and M. M. Fleck. D-theory: Talking about talking about trees. In Proceedings of the 21st ACL, pages 129-136, 1983.
12. Meyer-Viol, W., and R. Kempson. Sequential construction of logical forms. In Proceedings of the Third Conference on Logical Aspects of Computational Linguistics, Grenoble, France, 1998.
13. Muskens, R. Underspecified semantics. Technical Report 95, Universität des Saarlandes, Saarbrücken, 1998. To appear.
14. Rabin, M. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, 1969.
15. Reyle, U. Dealing with ambiguities by under specification: construction, representation, and deduction. Journal of Semantics, 10:123-179, 1993.
16. Rogers, J. Studies in the Logic of Trees with Applications to Grammar Formalisms. PhD thesis, University of Delaware, 1994.
17. Rogers, J., and K. Vijay-Shanker. Reasoning with descriptions of trees. In Proceedings of the 30th ACL, pages 72-80, University of Delaware, 1992.
18. Stockmeyer, L. J., and A. R. Meyer. Word problems requiring exponential time. In 5th Annual ACM Symposium on the Theory of Computing, pages 1-9, 1973.
19. Thatcher, J. W., and J. B. Wright. Generalized finite automata with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2:57-68, 1968.
20. Vijay-Shanker, K. Using descriptions of trees in a tree adjoining grammar. Computational Linguistics, 18:481-518, 1992.