Context Unification is in PSPACE
Contexts are terms with one ‘hole’, i.e. a place in which we can substitute an argument. In context unification we are given an equation over terms with variables representing contexts and ask about the satisfiability of this equation. Context unification at the same time is subsumed by a second-order unification, which is undecidable, and subsumes satisfiability of word equations, which is in PSPACE. We show that context unification is in PSPACE, so as word equations. For both problems NP is still the best known lower-bound.
This result is obtained by an extension of the recompression technique, recently developed by the author and used in particular to obtain a new PSPACE algorithm for satisfiability of word equations, to context unification. The recompression is based on applying simple compression rules (replacing pairs of neighbouring function symbols), which are (conceptually) applied on the solution of the context equation and modifying the equation in a way so that such compression steps can be performed directly on the equation, without the knowledge of the actual solution.
KeywordsContext unification Second order unification Term rewriting
Unable to display preview. Download preview PDF.
- 4.Jeż, A.: Recompression: a simple and powerful technique for word equations. In: Portier, N., Wilke, T. (eds.) STACS. LIPIcs, vol. 20, pp. 233–244. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl (2013)Google Scholar
- 10.Schmidt-Schauß, M.: Unification of stratified second-order terms, internal Report 12/94, Johann-Wolfgang-Goethe-Universität (1994)Google Scholar