Sciweavers

ACL
2000
14 years 26 days ago
A Polynomial-Time Fragment of Dominance Constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
Alexander Koller, Kurt Mehlhorn, Joachim Niehren
RTA
2000
Springer
14 years 3 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
CL
2000
Springer
14 years 3 months ago
Dominance Constraints with Set Operators
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
Denys Duchier, Joachim Niehren