Determining the consistency of partial tree descriptions

Authors:
Manuel Bodirsky;Martin Kutz
Affiliations:
Humboldt-Universität zu Berlin, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
Artificial Intelligence
Year:
2007

Citing 16
Cited 5

Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

Journal of the ACM (JACM)
Local and global relational consistency

Theoretical Computer Science - Special issue: principles and practice of constraint programming
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)
The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees

Discrete Applied Mathematics
Maintaining knowledge about temporal intervals

Communications of the ACM
The Constraint Language for Lambda Structures

Journal of Logic, Language and Information
Pure Dominance Constraints

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

Journal of the ACM (JACM)
D-theory: talking about talking about trees

ACL '83 Proceedings of the 21st 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
Relation Algebras and their Application in Temporal and Spatial Reasoning

Artificial Intelligence Review
Classifying the Complexity of Constraints Using Finite Algebras

SIAM Journal on Computing
Constraint Satisfaction with Countable Homogeneous Templates

Journal of Logic and Computation

Combining Tree Partitioning, Precedence, and Incomparability Constraints

Constraints
Constraint Satisfaction Problems with Infinite Templates

Complexity of Constraints
The complexity of rooted phylogeny problems

Proceedings of the 13th International Conference on Database Theory
Tractable set constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Tractable set constraints

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient algorithm that decides the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in computational linguistics; the constraints specify for pairs of nodes sets of admissible relative positions in an ordered tree. Cornell asked for an algorithm to find a tree structure satisfying these constraints. This computational problem generalizes the common-supertree problem studied in phylogenetic analysis, and also generalizes the network consistency problem of the so-called left-linear point algebra. We present the first polynomial time algorithm for Cornell's problem, which runs in time O(mn), where m is the number of constraints and n the number of variables in the constraint.