Parallelism Constraints

Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Parallelism constraints belong to the constraint language for lambda structures (CLLS) which serves for modeling natural language semantics. In this paper, we investigate the extension of parallelism constraints by tree regular constraints. This canonical extension is subsumed by the monadic secondorder logic over parallelism constraints. We analyze the precise expressiveness of this extension on basis of a new relationship between tree automata and logic. Our result is relevant for classifying different extensions of parallelism constraints, as in CLLS. Finally, we prove that parallelism constraints and context unification remain equivalent when extended with tree regular constraints.

• Type: Conference
• Year: 2000
• Where: RTA
• Authors: Katrin Erk, Joachim Niehren
• Keywords: Dominance Constraints, Parallelism Constraints, RTA 2000, Theoretical Computer Science, Tree Regular Constraints