Paper: On Determining The Consistency Of Partial Descriptions Of Trees

ACL ID P94-1023
Title On Determining The Consistency Of Partial Descriptions Of Trees
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1994
Authors

1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in the description, despite disjunctions inherent in the theory of trees. The resulting algorithm allows for descriptions which go beyond sets of atomic formulas to allow certain types of disjunction and negation.