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.
Cite
CITATION STYLE
Duchier, D., & Niehren, J. (2000). Dominance constraints with set operators. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 1861, pp. 326–341). Springer Verlag. https://doi.org/10.1007/3-540-44957-4_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
