Journal of Symbolic Computation
Completion of rewrite systems with membership constraints. Part I: deduction rules
Journal of Symbolic Computation - Special issue: order-sorted rewriting
A decision algorithm for distributive unification
Theoretical Computer Science - Special issue on rewriting techniques and applications
A Complete Mechanization of Second-Order Type Theory
Journal of the ACM (JACM)
On the undecidability of second-order unification
Information and Computation - Special issue on RTA-98
On rewrite constraints and context unification
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Completion of Rewrite Systems with Membership Constraints
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Solving Trace Equations Using Lexicographical Normal Forms
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On the Exponent of Periodicity of Minimal Solutions of Context Equation
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Decidable and Undecidable Second-Order Unification Problems
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
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
An Algorithm for Distributive 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
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
Currying Second-Order Unification Problems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
On the relation between Context and Sequence Unification
Journal of Symbolic Computation
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 was originally defined by H. Comon in ICALP'92, as the problem of finding a unifier for a set of equations containing first-order variables and context variables. These context variables have arguments, and can be instantiated by contexts. In other words, they are second-order variables that are restricted to be instantiated by linear terms (a linear term is a λ-expression λx1 ... λxn. t where every xi occurs exactly once in t). In this paper, we prove that, if the so called rank-bound conjecture is true, then the context unification problem is decidable. This is done reducing context unification to solvability of traversal equations (a kind of word unification modulo certain permutations) and then, reducing traversal equations to word equations with regular constraints.