Complexity of Makanin's algorithm
Journal of the ACM (JACM)
A decision algorithm for distributive unification
Theoretical Computer Science - Special issue on rewriting techniques and applications
On the undecidability of second-order unification
Information and Computation - Special issue on RTA-98
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
On the Exponent of Periodicity of Minimal Solutions of Context Equation
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
The First-Order Theory of One-Step Rewriting is Undecidable
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Undecidability of the First Order Theory of One-Step Right Ground Rewriting
RTA '97 Proceedings of the 8th 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
Higher Order Unification 30 Years Later
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Currying Second-Order Unification Problems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
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 |
Context unification is a natural variant of second order unification that represents a generalization of word unification at the same time. While second order unification is wellknown to be undecidable and word unification is decidable it is currently open if solvability of context equations is decidable. We show that solvability of systems of context equations with two context variables is decidable. The context variables may have an arbitrary number of occurrences, and the equations may contain an arbitrary number of individual variables as well. The result holds under the assumption that the first-order background signature is finite.