Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Studies in the logic of trees with applications to grammar formalisms
Studies in the logic of trees with applications to grammar formalisms
An efficient algorithm for the configuration problem of dominance graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Constraint Language for Lambda Structures
Journal of Logic, Language and Information
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Constraints over Lambda-Structures in semantic underspecification
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
On determining the consistency of partial descriptions of trees
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Reasoning with descriptions of trees
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
On underspecified processing of dynamic semantics
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
A polynomial-time fragment of dominance constraints
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Hi-index | 0.00 |
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.