Skip to Main content Skip to Navigation
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 metadatas

https://hal.inria.fr/inria-00536806
Contributor : Joachim Niehren <>
Submitted on : Tuesday, November 16, 2010 - 11:09:29 PM
Last modification on : Tuesday, October 31, 2017 - 2:22:18 PM
Long-term archiving on: : Thursday, February 17, 2011 - 3:14:11 AM

Files

dombool.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00536806, version 1

Citation

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⟩

Share

Metrics

Record views

103

Files downloads

221