Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Exact and approximate reasoning about temporal relations
Computational Intelligence
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Decremental dynamic connectivity
Journal of Algorithms
Maintaining knowledge about temporal intervals
Communications of the ACM
An efficient algorithm for the configuration problem of dominance graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Constraint Language for Lambda Structures
Journal of Logic, Language and Information
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Dominance Constraints with Set Operators
CL '00 Proceedings of the First International Conference on Computational Logic
Dominance Constraints: Algorithms and Complexity
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
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
A polynomial-time fragment of dominance constraints
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
A new algorithm for normal dominance constraints
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Determining the consistency of partial tree descriptions
Artificial Intelligence
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We present an efficient algorithm that checks the satisfiability of pure dominance constraints, which is a tree description language contained in several constraint languages studied in computational linguistics. Pure dominance constraints partially describe unlabeled rooted trees. For arbitrary pairs of nodes they specify sets of admissible relative positions in a tree. The task is to find a tree structure satisfying these constraints.Our algorithm constructs such a solution in time O(m2) where m is the number of constraints. This solves an essential part of an open problem posed by Cornell.