Bounded second-order unification is NP-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4098 LNCS, Issue , 2006, Pages 400-414

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

^a CSIC   (Spain)

^b GOETHE UNIVERSITY   (Germany)

^c IMA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); MATHEMATICAL MODELS; POLYNOMIALS;

BOUND VARIABLES; BOUNDED SECOND-ORDER UNIFICATION; PLANDOWSKI'S POLYNOMIAL; SECOND-ORDER EQUATION;

BOUNDARY VALUE PROBLEMS;

EID: 33749414131     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805618_30     Document Type: Conference Paper

References (20)

1. G. Busatto, M. Lohrey, and S. Maneth. Efficient memory representation of XML documents. In DBPL'05, volume 3774 of LNCS, pages 199-216, 2005.
2. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997. release 1.10.2002.
3. G. Dowek. Higher-order unification and matching. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume II, chapter 16, pages 1009-1062. Elsevier Science, 2001.
4. W. M. Farmer. Simple second-order languages for wich unification is undecidable. Theoretical Computer Science, 87:173-214, 1991.
5. W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225-230, 1981.
6. G. Huet. A unification algorithm for typed A-calculus. Theoretical Computer Science, 1:27-57, 1975.
7. A. Kościelski and L. Pacholski. Complexity of Makanin's algorithm. J. ACM, 43(4):670-684, 1996.
8. J. Levy, J. Niehren, and M. Villaret. Well-nested context unification. In CADE'05, volume 3632 of LNCS, pages 149-163, 2005.
9. J. Levy, M. Schmidt-Schauß, and M. Villaret. Monadic second-order unification is NP-complete. In RTA '04, volume 3091 of LNCS, pages 55-69, 2004.
10. J. Levy and M. Veanes. On the undecidability of second-order unification. Information and Computation, 159:125-150, 2000.
11. J. Levy and M. Villaret. Currying second-order unification problems. In RTA'02, volume 2378 of LNCS, pages 326-339, 2002.
12. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129-198, 1977.
13. A. Martelli and U. Montanari. An efficient unification algorithm. ACM TOPLAS, 4(2)-.258-282, 1982.
14. W. Plandowski. Testing equivalence of morphisms in context-free languages. In ESA '94, volume 855 of LNCS, pages 460-470, 1994.
15. W. Plandowski. The Complexity of the Morphism Equivalence Problem for ContextFree Languages. PhD thesis, Department of Mathematics, Informatics and Mechanics, Warsaw University, 1995.
16. M. Schmidt-Schau. Stratified context unification is in PSPACE. In CSL'01, volume 2142 of LNCS, pages 498-512, 2001.
17. M. Schmidt-Schauß. Decidability of bounded second order unification. Information and Computation, 188(2):143-178, 2004.
18. M. Schmidt-Schauß. Polynomial equality testing for terms with shared substructures. Frank report 21, Institut für Informatik. FB Informatik und Mathematik. J. W. Goethe-Universität Frankfurt am Main, November 2005.
19. M. Schmidt-Schauß and K. U. Schulz. On the exponent of periodicity of minimal solutions of context equations. In RTA '98, volume 1379 of LNCS, pages 61-75, 1998.
20. A. Schubert. Second-order unification and type inference for church-style polymorphism. In POPL'98, pages 279-288, 1998.