Higher-order unification revisited: Complete sets of transformations
Journal of Symbolic Computation
Simple second-order languages for which unification is undecidable
Theoretical Computer Science
Completion of rewrite systems with membership constraints. Part I: deduction rules
Journal of Symbolic Computation - Special issue: order-sorted rewriting
Completion of rewrite systems with membership constraints. Part II: constraint solving
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
Satisfiability of word equations with constants is in NEXPTIME
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
forall exists*-Equational Theory of Context Unification is Pi10-Hard
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer 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 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
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
The Security of Individual RSA Bits
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
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
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 is a variant of second order unification and also a generalization of string unification. Currently it is not known whether context unification is decidable. A decidable specialization of context unification is stratified context unification, which is equivalent to satisfiability of one-step rewrite constraints. This paper contains an optimization of the decision algorithm, which shows that stratified context unification can be done in polynomial space.