The complexity of monadic second-order unification

SIAM Journal on Computing

Volumn 38, Issue 3, 2008, Pages 1113-1140

  Levy, Jordi ^a   Manfred, Schmidt Schauß ^b   Villaret, Mateu ^c  

^a CSIC   (Spain)

^b GOETHE UNIVERSITY   (Germany)

^c UNIVERSITY OF GIRONA   (Spain)

Author keywords

Context free grammars; Lambda calculus; Rewriting systems; Second order unification; Theorem proving

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); THEOREM PROVING;

LAMBDA CALCULUS; NP COMPLETE; REWRITING SYSTEMS; SECOND ORDERS; SECOND-ORDER MATCHING;

CONTEXT FREE GRAMMARS;

EID: 55249085853     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050645403     Document Type: Article

References (24)

1. G. DOWEK, Higher-order unification and matching, in Handbook of Automated Reasoning, Vol. II, A. Robinson and A. Voronkov, eds., Elsevier Science, Amsterdam, 2001, pp. 1009-1062.
2. W. M. FARMER, A unification algorithm for second-order monadic terms, Ann. Pure Appl. Logic, 39 (1988), pp. 131-174.
3. W. M. FARMER, Simple second-order languages for which unification is undecidable, Theoret. Comput. Sci., 87 (1991), pp. 173-214.
4. M. R. GAREY AND D. S. JOHNSON, "Computers and Intractability": A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
5. W. D. GOLDFARB, The undecidability of the second-order unification problem, Theoret. Comput. Sci., 13 (1981), pp. 225-230.
6. G. HUET, A unification algorithm for typed, λ-calculus, Theoret. Comput. Sci., 1 (1975), pp. 27-57.
7. M. KARPINSKI, W. RYTTER, AND A. SHINOHARA, An efficient pattern-matching algorithm for strings with short descriptions, Nordic J. Comput., 4 (1997), pp. 172-186.
8. A. KOŚCIELSKI AND L. PACHOLSKI, Complexity of Makanin's algorithm, J. ACM, 43 (1996), pp. 670-684.
9. J. LEVY, Decidable and undecidable second-order unification problems, in Proceedings of the 9th Annual International Conference on Rewriting Techniques and Applications (RTA'98), Lecture Notes in Comput. Sci. 1379, Springer-Verlag, Berlin, 1998, pp. 47-60.
10. J. LEVY, M. SCHMIDT-SCHAUß, AND M. VILLARET, Monadic second-order unification is NP-complete, in Proceedings of the 15th Annual International Conference on Rewriting Techniques and Applications (RTA'04), Lecture Notes in Comput. Sci. 3091, Springer-Verlag, Berlin, 2004, pp. 55-69.
11. J. LEVY, M. SCHMIDT-SCHAUß, AND M. VILLARET, Bounded second-order unification is NP-complete, in Proceedings of the 17th Annual International Conference on Rewriting Techniques and Applications (RTA'06), Lecture Notes in Comput. Sci. 4098, Springer-Verlag, Berlin, 2006, pp. 400-414.
12. J. LEVY, M. SCHMIDT-SCHAUß, AND M. VILLARET, Stratified context unification is NP-complete, in Proceedings of the 3rd Annual International Joint Conference on Automated Reasoning (IJCAR'06), Lecture Notes in Comput. Sci. 4130, Springer-Verlag, Berlin, 2006, pp. 82-96.
13. J. LEVY AND M. VEANES, On the undecidability of second-order unification, Inform. and Comput., 159 (2000), pp. 125-150.
14. J. LEVY AND M. VILLARET, Currying second-order unification problems, in Proceedings of the 13th Annual International Conference on Rewriting Techniques and Applications (RTA'02), Lecture Notes in Comput. Sci. 2378, Springer-Verlag, Berlin, 2002, pp. 326-339.
15. Y. LIFSHITS, Solving Classical String Problems on Compressed Texts, The Computing Research Repository (CoRR); available online from http://www.avxiv.orgabs/cs/0604058 (2006).
16. G. S. MAKANIN, The problem of solvability of equations in a free semigroup, Sb. Math. USSR, 32 (1977), pp. 129-198.
17. W. PLANDOWSKI, Testing equivalence of morphisms on context-free languages, in Proceedings of the Second Annual European Symposium on Algorithms (ESA'94), Lecture Notes in Comput. Sci. 855, Springer-Verlag, London, 1994, pp. 460-470.
18. W. PLANDOWSKI, The Complexity of the Morphism Equivalence Problem for Context-Free Languages, Ph.D. thesis, Department of Mathematics, Informatics and Mechanics, Warsaw University, Warsaw, Poland, 1995.
19. W. PLANDOWSKI, Satisfiability of word equations with constants is in PSPACE, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS'99), pp. 495-500.
20. W. PLANDOWSKI, Satisfiability of word equations with constants is in PSPACE, J. ACM, 51 (2004), pp. 483-496.
21. M. SCHMIDT-SCHAUß, Stratified context unification is in PSPACE, in Proceedings of the 15th International Workshop in Computer Science Logic (CSL'01), Lecture Notes in Comput. Sci. 2142, Springer-Verlag, Berlin, 2001, pp. 498-512.
22. M. SCHMIDT-SCHAUß Decidability of bounded second order unification, Inform. and Compute., 188 (2004), pp. 143-178.
23. M. SCHMIDT-SCHAUß AND K. U. SCHULZ, On the exponent of periodicity of minimal solutions of context equations, in Proceedings of the 9th Annual International Conference on Rewriting Techniques and Applications (RTA'98), Lecture Notes in Comput. Sci. 1379, Springer- Verlag, Berlin, 1998, pp. 61-75.
24. A. P. ZHEZHERUN, Decidability of the unification problem for second-order languages with unary function symbols, Kibernetika (Kiev), 5 (1979), pp. 120-125 (in Russian); Cybernetics, 15 (1980), pp. 735-741 (in English).