Decidability of bounded second order unification

Information and Computation

Volumn 188, Issue 2, 2004, Pages 143-178

  Schmidt Schaus, Manfred ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Automated deduction; Context unification; Higher order unification; Lambda calculus; Logics in artificial intelligence; Rewriting; Second order unification; Unification

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BOUNDARY CONDITIONS; DECISION THEORY;

AUTOMATED DEDUCTION; CONTEXT UNIFICATION; DECISION ALGORITHM; LAMBDA CALCULUS; SECOND ORDER UNIFICATION;

COMPUTABILITY AND DECIDABILITY;

EID: 0742286326     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2003.08.002     Document Type: Article

References (26)

1. F. Baader, J. Siekmann, Unification theory, in: D. Gabbay, C. Hogger, J. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, 1994, pp. 41-125.
2. F. Baader, T. Nipkow, Term Rewriting and All That, Cambridge University Press, Cambridge, 1998.
3. H. Comon. Completion of rewrite systems with membership constraints. Part I: Deduction rules, J. Symbolic Comput. 25 (4) (1998) 397-419.
4. H. Comon, Completion of rewrite systems with membership constraints. Part II: Constraint solving, J. Symbolic Comput. 25 (4) (1998) 421-453.
5. N. Dershowitz, Z. Manna, Proving termination with multiset orderings, Commun. ACM 22 (1979) 465-476.
6. R.G. Downey, M.R. Fellows, Parametrized Complexity, Springer, Berlin, 1999.
7. W. Farmer, Simple second order languages for which unification is undecidable, J. Theor. Comput. Sci. 87 (1991) 173-214.
8. W. Farmer, A unification algorithm for second order monadic terms, Ann. Pure Appl. Logic 39 (1988) 131-174.
9. M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Co., San Francisco, 1979.
10. W.D. Goldfarb, The undecidability of the second order unification problem, Theor. Comput. Sci. 13 (1981) 225-230.
11. C. Gutierrez, Satisfiability of word equations with constants is in exponential space, in: Proceedings FOCS'98, IEEE Computer Society Press, Palo Alto, California, 1998, pp. 112-119.
12. G. Huet, A unification algorithm for typed λ-calculus, Theor. Comput. Sci. 1 (1975) 27-57.
13. J. Levy, Decidable and undecidable second order unification problems, in: Proceedings of the 9th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 1379, 1998, pp. 47-60.
14. J. Levy, M. Veanes, On the undecidability of second order unification, Informat. Comput. 159 (2000) 125-150.
15. J. Levy, Linear second order unification, in: Proceedings of the 7th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 1103, 1996, pp. 332-346.
16. G. Makanin, The problem of solvability of equations in a free semigroup, Math. USSR Sbornik 32 (2) (1977) 129-198.
17. W. Plandowski, Satisfiability of word equations with constants is in NEXPTIME, in: T. Leighton (Ed.), Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC'99), ACM Press, Atlanta, Georgia, pp. 721-725.
18. W. Plandowski, Satisfiability of word equations with constants is in PSPACE, in: FOCS 99, 1999, pp. 495-500.
19. M. Schmidt-Schauß, K.U. Schulz, On the exponent of periodicity of minimal solutions of context equations, in: Proceedings of the 9th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 1379, 1998, pp. 61-75.
20. M. Schmidt-Schauß, K.U. Schulz, Solvability of context equations with two context variables is decidable, in: Proceedings of the International Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 1632, 1999, pp. 67-81.
21. M. Schmidt-Schauß K.U. Schulz, Solvability of context equations with two context variables is decidable, J. Symbolic Comput. 33 (1) (2002) 77-122.
22. M. Schmidt-Schauß, Unification of stratified second order terms, Internal Report 12/94, Fachbereich Informatik, J.W. Goethe-Universität Frankfurt, Germany, 1994.
23. M. Schmidt-Schauß, A decision algorithm for distributive unification, Theor. Comput. Sci. 208 (1998) 111-148.
24. M. Schmidt-Schauß, A decision algorithm for stratified context unification, J. Logic Comput. 12 (6) (2002) 929-953.
25. W. Snyder, J. Gallier, Higher order unification revisited: complete sets of transformations, J. Symbolic Comput. 8 (1989) 101-140.
26. D.A. Wolfram, The Clausal Theory of Types, no. 21 in Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, 1993.