Dominance constraints with set operators

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 326-341

  Duchier, Denys ^a   Niehren, Joachim ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING LANGUAGES; DISTRIBUTION RULE; FINITE SET; SOUNDNESS AND COMPLETENESS;

COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY;

LOGIC PROGRAMMING;

EID: 84867760324     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_22     Document Type: Conference Paper

References (17)

1. 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.
2. D. Duchier and C. Gardent. A constraint-based treatment of descriptions. In Int. Workshop on Computational Semantics, Tilburg, 1999.
3. D. Duchier and S. Thater. Parsing with tree descriptions: a constraint-based approach. In Int. Workshop on Natural Language Understanding and Logic Program-ming, Las Cruces, New Mexico, 1999.
4. M. Egg, J. Niehren, P. Ruhrberg, and F. Xu. Constraints over lambda-structures in semantic underspeci-cation. In Joint Conf. COLING/ACL, pages 353-359, 1998.
5. C. Gardent and B. Webber. Describing discourse semantics. In Proceedings of the 4th TAG+ Workshop, Philadelphia, 1998.
6. C. Gervet. Interval propagation to reason about sets: De-nition and implementation of a practical language. Constraints, 1(3):191-244, 1997.
7. A. Koller, K. Mehlhorn, and J. Niehren. A polynomial-time fragment of dominance constraints. Technical report, Programming Systems Lab, Universität des Saarlandes, Apr. 2000. Submitted.
8. A. Koller, J. Niehren, and R. Treinen. Dominance constraints: Algorithms and complexity. In Logical Aspects of Comp. Linguistics 98, 2000. To appear in LNCS.
9. M. P. Marcus, D. Hindle, and M. M. Fleck. D-theory: Talking about talking about trees. In 21st ACL, pages 129-136, 1983.
10. Mozart. The mozart programming system. http://www.mozart-oz.org/.
11. T. Müller and M. Müller. Finite set constraints in Oz. In F. Bry, B. Freitag, and D. Seipel, editors Workshop Logische Programmierung, pages 104-115, Technische Universität München, 1997.
12. R. Muskens. Order-Independence and Underspeci-cation. In J. Groenendijk, editor, Ellipsis, Underspeci-cation, Events and More in Dynamic Semantics.DYANA Deliverable R.2.2.C, 1995.
13. O. Rambow, K. Vijay-Shanker, and D. Weir. D-tree grammars. In Proceedings of ACL'95, pages 151-158, MIT, Cambridge, 1995.
14. J. Rogers and K. Vijay-Shanker. Reasoni ng with descriptions of trees. In Annual Meeting of the Association for Comp. Linguistics (ACL), 1992.
15. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57-81, August 1967.
16. W. Thomas. Automata on Infinite Objects. In J. V. Leeuwen, editor, Handbook of Theoretical Computer Science, Fo rmal Models and Semantics, volume B, chapter 4, pages 133-191. The MIT Press, 1990.
17. K. Vijay-Shanker. Using descriptions of trees in a tree adjoining grammar. Com-putational Linguistics, 18:481-518, 1992.