Decidability of the purely existential fragment of the theory of term algebras
Journal of the ACM (JACM)
Feature-constraint logics for unification grammars
Journal of Logic Programming
Word unification and transformation of generalized equations
Journal of Automated Reasoning
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Handbook of logic in artificial intelligence and logic programming
A complete and recursive feature theory
Theoretical Computer Science
Decidability of unification in the theory of one-sided distributivity and a multiplicative unit
Journal of Symbolic Computation
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generalized Definite Set Constraints
Constraints
Sequential Construction of Logical Forms
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
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
On the Exponent of Periodicity of Minimal Solutions of Context Equation
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Linear Second-Order Unification
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Dominance Constraints: Algorithms and Complexity
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A uniform approach to underspecification and parallelism
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Constraints over Lambda-Structures in semantic underspecification
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
D-theory: talking about talking about trees
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Parallelism and Tree Regular Constraints
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Well-nested context unification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Describing lambda terms in context unification
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
Tree descriptions based on dominance constraints are popular in several areas of computational linguistics including syntax, semantics, and discourse. Tree descriptions in the language of context unification have attracted some interest in unification and rewriting theory. Recently, dominance constraints and context unification have both been used in different underspecified approaches to the semantics of scope, parallelism, and their interaction. This raises the question whether both description languages are related. In this paper, we show for a first time that dominance constraints can be expressed in context unification. We also prove that dominance constraints extended with parallelism constraints are equal in expressive power to context unification.