A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Pure Dominance Constraints
[chapter]
2002
Lecture Notes in Computer Science
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(m 2 )
doi:10.1007/3-540-45841-7_23
fatcat:x2i5cgmwlbey7gplr4362vikgy