Abstract
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of a new rather restricted kind of second-order unification. We also show that certain decidable subclasses of the problem which are P-complete in the equational case become EXPTIME-complete when symmetry is absent. By applying automata-theoretic methods, simultaneous monadic rigid reachability with ground rules is shown to be in EXPTIME.
A full version of this paper is available as MPI-I Research Report MPI-I-98-2-013.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
J.-L. Coquidé and R. Gilleron. Proofs and reachability problem for ground rewrite systems. In Proc. of the 6th International Meeting of Young Computer Scientists, volume 464 of LNCS, pages 120–129, 1990.
J.L. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvölgyi. Bottom-up tree pushdown automata: classification and connection with rewrite systems. Theoretical Computer Science, 127:69–98, 1994.
V. Cortier. PSPACE-completeness of monadic simultaneous rigid reachability. Unpublished manuscript, july 1998.
M. Dauchet. Rewriting and tree automata. In H. Comon and J.P. Jouannaud, editors, Term Rewriting (French Spring School of Theoretical Computer Science), volume 909 of Lecture Notes in Computer Science, pages 95–113. Springer Verlag, Font Romeux, France, 1993.
Max Dauchet, Thierry Heuillard, Pierre Lescanne, and Sophie Tison. The confluence of ground term rewriting systems is decidable. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, 1988.
A. Degtyarev, Yu. Gurevich, P. Narendran, M. Veanes, and A. Voronkov. The decidability of simultaneous rigid E-unification with one variable. In T. Nipkow, editor, Rewriting Techniques and Applications, volume 1379 of Lecture Notes in Computer Science, pages 181–195. Springer Verlag, 1998.
A. Degtyarev and A. Voronkov. Simultaneous rigid E-unification is undecidable. UPMAIL Technical Report 105, Uppsala University, Computing Science Department, May 1995.
N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter 6, pages 243–309. North Holland, Amsterdam, 1990.
J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406–451, 1970.
W.M. Farmer. Simple second-order languages for which unification is undecidable. Theoretical Computer Science, 87:25–41, 1991.
Thom Frühwirth, Ehud Shapiro, Moshe Y.Vardi, and Eyal Yardemi. Logic programs as types for logic programs. In 6th IEEE Symp. Logic In Computer Science, pages 300–309, 1991.
J.H. Gallier, P. Narendran, D. Plaisted, and W. Snyder. Rigid E-unification is NP-complete. In Proc. IEEE Conference on Logic in Computer Science (LICS), pages 338–346. IEEE Computer Society Press, July 1988.
J.H. Gallier, S. Raatz, and W. Snyder. Theorem proving using rigid E-unification: Equational matings. In Proc. IEEE Conference on Logic in Computer Science (LICS), pages 338–346. IEEE Computer Society Press, 1987.
W.D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225–230, 1981.
Y. Gurevich and M. Veanes. Partisan corroboration, and shifted pairing. Research Report MPI-I-98-2-014, Max-Planck-Institut für Informatik, September 1998.
Y. Gurevich and A. Voronkov. Monadic simultaneous rigid E-unification and related problems. In P. Degano, R. Corrieri, and A. Marchetti-Spaccamella, editors, Automata, Languages and Programming, 24th International Colloquium, ICALP’97, volume 1256 of Lecture Notes in Computer Science, pages 154–165. Springer Verlag, 1997.
D. Kozen. Complexity of finitely presented algebras. In Proc. 9th STOC, pages 164–177, 1977.
J. Levy. Decidable and undecidable second-order unification problems. In T. Nipkow, editor, Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March/April 1998, Proceedings, volume 1379 of Lecture Notes in Computer Science, pages 47–60. Springer Verlag, 1998.
J. Levy and M. Veanes. On the undecidability of second-order unification. Submitted to Information and Computation, 1998.
Helmut Seidl. Haskell overloading is dexptime-complete. Inf. Process. Letters, 52:57–60, 1994.
J.W. Thatcher and J.B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57–81, 1968.
M. Veanes. The relation between second-order unification and simultaneous rigid E-unification. In Proc. Thirteenth Annual IEEE Symposium on Logic in Computer Science, June 21–24, 1998, Indianapolis, Indiana (LICS’98), pages 264–275. IEEE Computer Society Press, 1998.
Margus Veanes. On computational complexity of basic decision problems of finite tree automata. Technical Report 133, Computing Science Department, Uppsala University, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganzinger, H., Jacquemard, F., Veanes, M. (1998). Rigid Reachability. In: Hsiang, J., Ohori, A. (eds) Advances in Computing Science ASIAN 98. ASIAN 1998. Lecture Notes in Computer Science, vol 1538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49366-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-49366-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65388-2
Online ISBN: 978-3-540-49366-2
eBook Packages: Springer Book Archive