A decision algorithm for stratified context unification

Journal of Logic and Computation

Volumn 12, Issue 6, 2002, Pages 929-953

  Schmidt Schauß, Manfred ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

Automated deduction; Constraint solving; Context unification; String unification; Unification

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ESTIMATION; POLYNOMIALS; PROBLEM SOLVING;

CONTEXT UNIFICATION;

DECISION THEORY;

EID: 0037216073     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/12.6.929     Document Type: Article

References (32)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. A.-C. Caron, F. Seynhaeve, S. Tison, and M. Tommasi. Deciding the satisfiability of quantifier free formulae on one-step rewriting. In Proceedings of the Tenth International Conference on Rewriting Techniques and Applications, volume 1631 of Lecture Notes in Computer Science, pp. 103-117. Springer-Verlag, 1999.
3. 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.
4. H. Comon. Completion of rewrite systems with membership constraints. Part I: Deduction roles. Journal of Symbolic Computation,:25, 397-419, 1998.
5. H. Comon. Completion of rewrite systems with membership constraints. Part II: Constraint solving. Journal of Symbolic Computation, 25, 421-453, 1998.
6. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM, 22, 465-476, 1979.
7. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3, 69-116, 1987.
8. W.A. Farmer. Simple second-order languages for which unification is undecidable. Journal of Theoretical Computer Science, 87, 173-214, 1991.
9. W.D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13, 225-230, 1981.
10. C. Gutierrez. Satisfiability of word equations with constants is in exponential space. In Proceedings FOCS'98, pp. 112-119, Palo Alto, California, 1998. IEEE Computer Society Press.
11. C. Höhl. Funktionale Implementierung eines Unifikationsalgorithmus füt Stratified Second-Order Terme. Diploma thesis, J.W.Goethe-Universität Frankfurt, 1997. In German.
12. G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1, 27-57, 1975.
13. A. Kościelski and L. Pacholski. Complexity of Makanin's algorithms. Journal of the Association for Computing Machinery, 43, 670-684, 1996.
14. J. Levy. Linear second order unification. In Proceedings of the Seventh International Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pp. 332-346, 1996.
15. J. Levy and M. Veanes. On the undecidability of second-order unification, Information and Computation, 159, 125-150, 2000.
16. G.S. Makanin, The problem of solvability of equations in a free semigroup. Math. USSR Sbornik, 32, 129-198, 1977.
17. J. Niehren, M. Pinkal, and P. Ruhrberg. On equality up-to constraints over finite trees, context unification, and one-step rewriting. In Proceedings of the International Conference on Automated Deduction, volume 1249 of Lecture Notes in Computer Science, pp. 34-48, 1997.
18. J. Niehren, M. Pinkal and P. Ruhrberg. A uniform approach to underspecification and parallelism. In Proceedings of the Thirty-fifth Annual Meeting of the Association of Computational Linguistics (ACL), pp. 410-417, Madrid, Spain, 1997.
19. J. Niehren, S. Tison, and R. Treinen. On rewrite constraints and context unification. Information Processing Letters, 74, 35-40, 2000.
20. T. Pietrzykowski. A complete mechanization of second-order type theory. Journal of the ACM, 20, 333-364, 1973.
21. W. Plandowski. Satisfiability of word equations with constants is in NEXPTIME. In Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing (STOC'99), T. Leighton, ed. pp. 721-725, Atlanta, Georgia, 1999. ACM Press.
22. W. Plandowski. Satisfiability of word equations with constants is in PSPACE. In FOCS 99, pp. 495-500, 1999.
23. C. Prehofer. Solving Higher-order Equations: From Logic to Programming. PhD thesis, Technische Universität München, 1995. In German.
24. M. Schmidt-Schauß. Unification of stratified second-order terms. Internal Report 12/94, Fachbereich Informatik, J.W. Goethe-Universität Frankfurt, Frankfurt, Germany, 1994.
25. M. Schmidt-Schauß. Unification of stratified second-order terms, 1995. Available from the author.
26. M. Schmidt-Schauß. A decision algorithm for distributive unification. Theoretical Computer Science, 208, 111-148, 1998.
27. M. 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.
28. M. Schmidt-Schauß and Klaus U. Schulz. On the exponent of periodicity of minimal solutions of context equations. In Proceedings of the Ninth international Conference on Rewriting Techniques and Applications, volume 1379 of Lecture Notes in Computer Science, pp. 61-75, 1998.
29. M. Schmidt-Schauß and K.U. Schulz. Solvability of context equations with two context variables is decidable. In Proceedings of the International Conference on Automated Deduction, volume 1632 of Lecture Notes in Computer Science, pp. 67-81, 1999.
30. W. Snyder and J. Gallier. Higher-order unification revisited: Complete sets of transformations, Journal of Symbolic Computation, 8, 101-140, 1989.
31. R. Treinen. The first-order theory of one-step rewriting is undecidable. In Proceedings of the 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pp. 276-286. Springer-Verlag, 1996.
32. 0-hard. In MFCS 1998, volume 1450 of Lecture Notes in Computer Science, pp. 597-606. Springer-Verlag, 1998.