Dominance Constraints with Set Operators

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.

• Type: Conference
• Year: 2000
• Where: CL
• Authors: Denys Duchier, Joachim Niehren
• Keywords: Automated Reasoning, CL 2000, Computational Linguistics, Dominance Constraints, Set Operators