On the complexity of bounded second-order unification and stratified context unification

Logic Journal of the IGPL

Volumn 19, Issue 6, 2011, Pages 763-789

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

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b GOETHE UNIVERSITY   (Germany)

^c IMA   (Spain)

Author keywords

Bounded Second Order Unification; Context Unification; Lambda Calculus; Tree Grammars

Indexed keywords

EID: 80054027164     PISSN: 13670751     EISSN: 13689894     Source Type: Journal    
DOI: 10.1093/jigpal/jzq010     Document Type: Article

References (36)

1. Busatto, G., Lohrey, M., Maneth, S., 2005. Efficient memory representation of XML documents. In: Proc. of the 10th Int. Symp. on Database Programming Languages, DBPL'05. Vol. 3774 of Lecture Notes in Computer Science. pp. 199-216.
2. Caron, A.-C., Coquidé, J.-L., Dauchet, M., 1993. Encompassment properties and automata with constraints. In: Proc. of the 5th Int. Conf. on Rewriting Techniques and Applications, RTA'93. Vol. 690 of Lecture Notes in Computer Science. pp. 328-342.
3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M., 2007. Tree automata techniques and applications. URL http://tata.gforge.inria.fr.
4. Dowek, G., 2001. Higher-order unification and matching. In: Robinson, A., Voronkov, A. (Eds.), Handbook of Automated Reasoning. Vol. II. Elsevier Science, Ch. 16, pp. 1009-1062.
5. Engelfriet, J., Schmidt, E. M., 1977. IO and OI. I. Journal of Computer and System Sciences 15 (3), 328-353.
6. Engelfriet, J., Schmidt, E. M., 1978. IO and OI. II. Journal of Computer and System Sciences 16 (1), 67-99.
7. Farmer, W. M., 1988. A unification algorithm for second-order monadic terms. Annals of Pure and Applied Logic 39, 131-174.
8. Farmer, W. M., 1991. Simple second-order languages for which unification is undecidable. Theoretical Computer Science 87, 173-214.
9. Gascón, A., Godoy, G., Schmidt-Schauß, M., 2008. Context matching for compressed terms. In: Proc. of the 23rd Annual IEEE Symp. on Logic in Computer Science, LICS'08. pp. 93-102.
10. Gascón A., Godoy, G., Schmidt-Schauß, M., 2009. Unification with singleton tree grammars. In: Proc. of the 20th Int. Conf. on Rewriting Techniques and Applications, RTA'09. Vol. 5595 of Lecture Notes in Computer Science. Springer, pp. 365-379.
11. Goldfarb, W. D., 1981. The undecidability of the second-order unification problem. Theoretical Computer Science 13, 225-230.
12. Kościelski, A., Pacholski, L., 1996. Complexity of Makanin's algorithm. Journal of the ACM 43 (4), 670-684.
13. Kutsia, T., Levy, J., Villaret, M., 2007. Sequence unification through currying. In: Proc. of the 18th Int. Conf. on Rewriting Techniques and Applications, RTA'07. Vol. 4533 of Lecture Notes in Computer Science. Springer, pp. 288-302.
14. Levy, J., 1996. Linear second order unification. In: Proc. of the 7th Int. Conf. on Rewriting Techniques and Applications, RTA'96. Vol. 1103 of Lecture Notes in Computer Science. pp. 332-346.
15. Levy, J., Niehren, J., Villaret, M., 2005.Well-nested context unification. In: Proc. of the 20th Int. Conf. on Automated Deduction, CADE-20. Vol. 3632 of Lecture Notes in Computer Science. pp. 149-163.
16. Levy, J., Schmidt-Schauß, M., Villaret, M., 2004. Monadic second-order unification is NPcomplete. In: Proc. of the 15th Int. Conf. on Rewriting Techniques and Applications, RTA'04. Vol. 3091 of Lecture Notes in Computer Science. pp. 55-69.
17. Levy, J., Schmidt-Schauß, M., Villaret, M., 2006a. Bounded second-order unification is NPcomplete. In: Proc. of the 17th Int. Conf. on Rewriting Techniques and Applications, RTA'06. Vol. 4098 of Lecture Notes in Computer Science. pp. 400-414.
18. Levy, J., Schmidt-Schauß, M., Villaret, M., 2006b. Stratified context unification is NPcomplete. In: Proc. of the 3rd Int. Joint Conf. on Automated Reasoning, IJCAR'06. Vol. 4130 of Lecture Notes in Computer Science. pp. 82-96.
19. Levy, J., Schmidt-Schauß, M., Villaret, M., 2008. The complexity of monadic second-order unification. SIAM Journal on Computing 38 (3), 1113-1140.
20. Levy, J., Veanes, M., 2000. On the undecidability of second-order unification. Information and Computation 159, 125-150.
21. Levy, J., Villaret, M., 2002. Currying second-order unification problems. In: Proc. of the 13th Int. Conf. on Rewriting Techniques and Applications, RTA'02. Vol. 2378 of Lecture Notes in Computer Science. pp. 326-339.
22. Lifshits, Y., 2006. Solving classical string problems on compressed texts. CoRR abs/cs/0604058.
23. Lifshits, Y., 2007. Processing compressed texts: A tractability border. In: Proc. of the 18th Annual Symp. on Combinatorial Pattern Matching, CPM'07. pp. 228-240.
24. Lohrey, M., 2006. Word problems and membership problems on compressed words. SIAM Journal on Computing 35 (5), 1210-1240.
25. Lohrey, M., Maneth, S., Schmidt-Schauß, M., 2009. Parameter reduction in grammarcompressed trees. In: Proc. of the 12th Int. Conf. on Foundations of Software Science and Computational Structures, FoSSaCS'09. Vol. 5504 of Lecture Notes in Computer Science. pp. 212-226.
26. Makanin, G. S., 1977. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik 32 (2), 129-198.
27. Niehren, J., Tison, S., Treinen, R., 2000. On rewrite constraints and context unification. Information Processing Letters 74, 35-40.
28. Plandowski, W., 1994. Testing equivalence of morphisms in context-free languages. In: Proc. of the 2nd Annual European Symp. on Algorithms, ESA'94. Vol. 855 of Lecture Notes in Computer Science. pp. 460-470.
29. Plandowski, W., 1995. The complexity of the morphism equivalence problem for contextfree languages. Ph.D. thesis, Dept. of Mathematics, Informatics and Mechanics, Warszaw University.
30. Plandowski, W., Rytter, W., 1999. Complexity of language recognition problems for compressed words. In: Jewels are Forever. Springer, pp. 262-272.
31. Rounds, W. C., 1969. Context-free grammars on trees. In: Proc. of the 1st ACM Symposium on Theory of Computing, STOC'69. pp. 143-148.
32. Schmidt-Schauß, M., 2002. A decision algorithm for stratified context unification. Journal of Logic and Computation 12 (6), 929-953.
33. Schmidt-Schauß, M., 2004. Decidability of bounded second order unification. Information and Computation 188 (2), 143-178.
34. Schmidt-Schauß, M., 2005. Polynomial equality testing for terms with shared substructures. Frank report 21, Institut für Informatik. FB Informatik und Mathematik. J. W. Goethe-Universiẗat Frankfurt am Main.
35. Schmidt-Schauß, M., Schulz, K. U., 1998. On the exponent of periodicity of minimal solutions of context equations. In: Proc. of the 9th Int. Conf. on Rewriting Techniques and Applications, RTA'98. Vol. 1379 of Lecture Notes in Computer Science. pp. 61-75.
36. Schmidt-Schauß, M., Schulz, K. U., 2002. Solvability of context equations with two context variables is decidable. Journal of Symbolic Computation 33 (1), 77-122.