Abstract
The unification problem for term rewriting systems(TRSs) is the problem of deciding, for a given TRS R and two terms M and N, whether there exists a substitution θ such that Mθ and Nθ are congruent modulo R (i.e., \( M\theta \leftrightarrow *_R N\theta \) ). In this paper, the unification problem for con uent right-ground TRSs is shown to be decidable. To show this, the notion of minimal terms is introduced and a new unification algorithm of obtaining a substitution whose range is in minimal terms is proposed. Our result extends the decidability of unification for canonical (i.e., confluent and terminating) right-ground TRSs given by Hullot (1980) in the sense that the termination condition can be omitted. It is also exemplified that Hullot’s narrowing technique does not work in this case. Our result is compared with the undecidability of the word (and also unification) problem for terminating right-ground TRSs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. Comon, M. Haberstrau and J.-P. Jouannaud, Syntacticness, Cycle-Syntacticness and Shallow Theories, Information and Computation, 111(1), pp. 154–191, 1994.
M. Dauchet and S. Tison, The Theory of Ground Rewriting Systems is Decidable, Proc. 5th IEEE Symp. Logic in Computer Science, pp. 242–248, 1990.
N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science, Vol. B, ed. J. van Leeuwen, pp. 243–320, North-Holland, Amsterdam, 1990.
J.-M. Hullot, Canonical Forms and Unification, Proc. 5th CADE, LNCS 87, pp. 318–334, 1980.
F. Jacquemard, C. Meyer and C. Weidenbach, Unification in Extensions of Shallow Equational Theories, In Proc. 9th Rewriting Techniques and Applications, LNCS 1379, pp. 76–90, 1998.
A. Middeldorp and S. Okui, A Deterministic Lazy Narrowing Calculus, Journal of Symbolic Computation 25(6), pp. 733–757, 1998.
A. Middeldorp, S. Okui and T. Ida, Lazy Narrowing: Strong Completeness and Eager Variable Elimination, Theoret. Comput. Sci. 167, pp. 95–130, 1996.
R. Nieuwenhuis, Basic Paramodulation and Decidable Theories, Proc. 11th Annual IEEE Symp. Logic in Computer Science, pp. 473–482, 1996.
M. Oyamaguchi, The Reachability and Joinability Problems for Right-Ground Term-Rewriting Systems, Journal of Information Processing, Vol. 13,No. 3, pp. 347–354, 1990.
M. Oyamaguchi, On the Word Problem for Right-Ground Term-Rewriting Systems, Trans. IEICE, Vol. E73,No. 5, pp. 718–723, 1990.
M. Oyamaguchi and Y. Toyama, On the Church-Rosser Property of E-overlapping and Simple-Right-Linear TRS’s, Research Reports of the Faculty of Engineering, Mie Univ., 20, pp. 99–118, 1995.
A. Martelli and G. Rossi, Efficient Unification with Infinite Terms in Logic Programming, Proc. Fifth Generation Computer Systems, pp. 202–209, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oyamaguchi, M., Ohta, Y. (2001). The Unification Problem for Confluent Right-Ground Term Rewriting Systems. In: Middeldorp, A. (eds) Rewriting Techniques and Applications. RTA 2001. Lecture Notes in Computer Science, vol 2051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45127-7_19
Download citation
DOI: https://doi.org/10.1007/3-540-45127-7_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42117-7
Online ISBN: 978-3-540-45127-3
eBook Packages: Springer Book Archive