On Determining the Consistency of Partial Descriptions of Trees

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.

• Type: Conference
• Year: 1994
• Where: ACL
• Authors: Tom Cornell
• Keywords: ACL 1994, ACL 2007, Consistency Problem, Consistency-checking Algorithm, Remote Dominance