Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2003

Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment

Résumé

Dominance constraints are a language of tree descriptions. Tree descriptions are widely used in computational linguistics for talking and reasoning about trees. While previous research has focused on the conjunctive fragment, we now extend the account to all Boolean connectives and propose a new formalism that combines dominance constraints with a feature tree logic. Although the satisfiability problem in the conjunctive fragment is known to be NP-complete, we have previously demonstrated that it can be addressed very effectively by constraint propagation: we developed an encoding that transforms a dominance constraint into a constraint satisfaction problem on finite sets solvable by constraint programming. We present a generalization of this encoding for our more expressive formalism, and prove soundness and completeness. Our main contribution is a treatment of disjunction suitable for constraint propagation.

Dates et versions

inria-00099677 , version 1 (26-09-2006)

Identifiants

Citer

Denys Duchier. Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment. Theoretical Computer Science, 2003, 293 (2), pp.321-343. ⟨10.1016/S0304-3975(01)00350-4⟩. ⟨inria-00099677⟩
49 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More