Dominance Constraints with Set Operators

Authors:
Denys Duchier;Joachim Niehren
Affiliations:
-;-
Venue:
CL '00 Proceedings of the First International Conference on Computational Logic
Year:
2000

Citing 7
Cited 2

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Using descriptions of trees in a tree adjoining grammar

Computational Linguistics
Dominance Constraints: Algorithms and Complexity

LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Constraints over Lambda-Structures in semantic underspecification

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
D-theory: talking about talking about trees

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
D-tree grammars

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Reasoning with descriptions of trees

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics

Pure Dominance Constraints

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Metagrammar redux

CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by admitting set operators. We present a solver for dominance constraints with set operators, which is based on propagation and distribution rules, and prove its soundness and completeness. From this solver, we derive an implementation in a constraint programming language with finite sets and prove its faithfullness.