Dominance Constraints with Set Operators - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2000

Dominance Constraints with Set Operators

Denys Duchier
  • Fonction : Auteur
  • PersonId : 926109
Joachim Niehren

Résumé

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.
Fichier principal
Vignette du fichier
dombool.pdf (335.53 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00536806 , version 1 (16-11-2010)

Identifiants

  • HAL Id : inria-00536806 , version 1

Citer

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⟩
31 Consultations
137 Téléchargements

Partager

Gmail Facebook X LinkedIn More