Stratified context unification is in PSPACE

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

Volumn 2142, Issue , 2001, Pages 498-513

  Schmidt Schauß, Manfred ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY;

CONTEXT UNIFICATIONS; DECISION ALGORITHMS; POLYNOMIAL SPACE; SATISFIABILITY; SECOND ORDERS;

COMPUTER CIRCUITS;

EID: 84944212694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44802-0_35     Document Type: Conference Paper

References (27)

1. H. Comon. Completion of rewrite systems with membership constraints, part I: Deduction rules and part II: Constraint solving. Technical report, CNRS and LRI, Université de Paris Sud, 1993.
2. H. Comon. Completion of rewrite systems with membership constraints. Part I: Deduction rules. J. Symbolic Computation, 25(4):397-419, 1998.
3. H. Comon. Completion of rewrite systems with membership constraints. Part II: Constraint solving. J. Symbolic Computation, 25(4):421-453, 1998.
4. Katrin Erk and Joachim Niehren. Parallelism constraints. In Proc. of the 11th RTA, volume 1833 of LNCS, pages 110-126, 2000.
5. W.A. Farmer. Simple second-order languages for which unification is undecidable. J. Theoretical Computer Science, 87:173-214, 1991.
6. W.D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225-230, 1981.
7. C. Gutierrez. Satisfiability of word equations with constants is in exponential space. In Proc. FOCS’98, pages 112-119, Palo Alto, California, 1998. IEEE Computer Society Press.
8. Gerard Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
9. Jordi Levy. Linear second order unification. In Proc. of the 7th RTA, volume 1103 of LNCS, pages 332-346, 1996.
10. Jordi Levy and Margus Veanes. On the undecidability of second-order unification. Information and Computation, 159:125-150, 2000.
11. Jordi Levy and Mateu Villaret. Linear second-order unification and context unification with tree-regular constraints. In Proc. of the 11th RTA, volume 1833 of LNCS, pages 156-171, 2000.
12. G.S. Makanin. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32(2):129-198, 1977.
13. Joachim Niehren, Manfred Pinkal, and P. Ruhrberg. On equality up-to constraints over finite trees, context unification, and one-step rewriting. In CADE’97, volume 1249 of LNCS, pages 34-48, 1997.
14. Joachim Niehren, Manfred Pinkal, and Peter Ruhrberg. A uniform approach to underspecification and parallelism. In Proc. of the 35th Annual Meeting of the Ass. of Computational Linguistics, pages 410-417, Madrid, Spain, 1997.
15. Joachim Niehren, Sophie Tison, and Ralf Treinen. On rewrite constraints and context unification. Information Processing Letters, 74:35-40, 2000.
16. T. Pietrzykowski. A complete mechanization of second-order type theory. J. ACM, 20:333-364, 1973.
17. W. Plandowski. Satisfiability of word equations with constants is in NEXPTIME. In T. Leighton, editor, Proc. STOC’99, pages 721-725, Atlanta, Georgia, 1999. ACM Press.
18. W. Plandowski. Satisfiability of word equations with constants is in PSPACE. In FOCS 99, pages 495-500, 1999.
19. Wayne Snyder and Jean Gallier. Higher-order unification revisited: Complete sets of transformations. J. Symbolic Computation, 8:101-140, 1989.
20. Manfred Schmidt-Schauß. Unification of stratified second-order terms. Internal Report 12/94, Fachbereich Informatik, J.W. Goethe-Universit¨at Frankfurt, Frankfurt, Germany, 1994.
21. Manfred Schmidt-Schauß. A decision algorithm for distributive unification. TCS, 208:111-148, 1998.
22. Manfred Schmidt-Schauß. Decidability of bounded second order unification. Technical Report Frank-report-11, FB Informatik, J.W. Goethe-Universität Frankfurt am Main, 1999. submitted for publication.
23. Manfred Schmidt-Schauß. A decision algorithm for stratified context unification. Frank-Report 12, Fachbereich Informatik, J.W. Goethe- Universität Frankfurt, Frankfurt, Germany, 1999. accepted for publication in Journal of Logic and Computation, preliminary version available at http://www.ki.informatik.uni-frankfurt.de/papers/articles.html.
24. Manfred Schmidt-Schauß. An optimized decision algorithm for stratified context unification. Technical Report Frank-report-13, FB Informatik, J.W. Goethe-Universit¨at Frankfurt am Main, 1999.
25. Manfred Schmidt-Schauß and Klaus U. Schulz. On the exponent of periodicity of minimal solutions of context equations. In Proc. of the 9th RTA, volume 1379 of LNCS, pages 61-75, 1998.
26. Manfred Schmidt-Schauß and Klaus U. Schulz. Solvability of context equations with two context variables is decidable. In Proc. of the Int. Conf. on Automated Deduction, volume 1632 of LNCS, pages 67-81, 1999.
27. 1 -hard. In MFCS 1998, volume 1450 of LNCS, pages 597-606.Springer-Verlag, 1998.