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
Application of Lempel-Ziv Encodings to the Solution of Words Equations
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Linear Second-Order Unification
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Solvability of Context Equations with Two Context Variables is Decidable
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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
Higher-Order Coloured Unification and natural language semantics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
A new algorithm for normal dominance constraints
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Well-nested parallelism constraints for ellipsis resolution
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Dominance constraints in stratified context unification
Information Processing Letters
On the relation between Context and Sequence Unification
Journal of Symbolic Computation
Context unification with one context variable
Journal of Symbolic Computation
Sequence unification through currying
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Bounded second-order unification is NP-complete
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU–well-nested CU – and present a new unification algorithm that solves well-nested context equations in non-deterministic polynomial time. We show that minimal well-nested solutions of context equations can be composed from the material present in the equation (see Theorem[1]). This property is wishful when modeling natural language ellipsis in CU.