On determining the consistency of partial descriptions of trees

15Citations
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.

References Powered by Scopus

Maintaining Knowledge about Temporal Intervals

5481Citations
N/AReaders
Get full text

Consistency in networks of relations

1678Citations
N/AReaders
Get full text

Networks of constraints: Fundamental properties and applications to picture processing

894Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Constraint satisfaction with countable homogeneous templates

89Citations
N/AReaders
Get full text

Monotonic syntactic processing: A cross-linguistic study of attachment and reanalysis

85Citations
N/AReaders
Get full text

Cores of countably categorical structures

54Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 19

59%

Researcher 8

25%

Professor / Associate Prof. 3

9%

Lecturer / Post doc 2

6%

Readers' Discipline

Tooltip

Computer Science 24

75%

Linguistics 5

16%

Social Sciences 2

6%

Philosophy 1

3%

Save time finding and organizing research with Mendeley

Sign up for free