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.
Type de document :
Communication dans un congrès
Proceedings of the First International Conference on Computational Logic, 2000, London, United Kingdom. Springer, 1861, pp.326-341, 2000, Lecture Notes on Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00536806
Contributeur : Joachim Niehren <>
Soumis le : mardi 16 novembre 2010 - 23:09:29
Dernière modification le : mardi 31 octobre 2017 - 14:22:18
Document(s) archivé(s) le : jeudi 17 février 2011 - 03:14:11

Fichiers

dombool.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. Springer, 1861, pp.326-341, 2000, Lecture Notes on Computer Science. 〈inria-00536806〉

Partager

Métriques

Consultations de la notice

57

Téléchargements de fichiers

84