On determining the consistency of partial descriptions of trees

N/ACitations
Citations of this article
69Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Cornell, T. L. (1994). On determining the consistency of partial descriptions of trees. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1994-June, pp. 163–170). Association for Computational Linguistics (ACL). https://doi.org/10.3115/981732.981755

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free