Skip to Main content Skip to Navigation
New interface
Conference papers

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. Set operators contribute a controlled form of disjunction that is emminently well-suited for constraint propagation. We present a solver for dominance constraints with set operators as a system of abstract propagation and distribution rules, and prove its soundness and completeness. We then derive an efficient implementation in a constraint programming language with finite sets and prove its faithfullness to the abstract inference rules.
Complete list of metadata
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 11:09:29 PM
Last modification on : Friday, February 11, 2022 - 6:44:04 PM
Long-term archiving on: : Thursday, February 17, 2011 - 3:14:11 AM


Files produced by the author(s)


  • HAL Id : inria-00536806, version 1


Denys Duchier, Joachim Niehren. Dominance Constraints with Set Operators. Proceedings of the First International Conference on Computational Logic, 2000, London, United Kingdom. pp.326-341. ⟨inria-00536806⟩



Record views


Files downloads