The monadic second-order logic of graphs XIII: graph drawings with edge crossings
Theoretical Computer Science
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
Dominance Constraints in Context Unification
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
Completion of Rewrite Systems with Membership Constraints
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
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 underspecified processing of dynamic semantics
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Describing lambda terms in context unification
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
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 second-order 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.