Abstract
Computation with a term rewrite system (TRS) consists of the application of rules from a given starting term until a normal form is reached. Two natural questions arise from this the definition: whether all terms can reach at least one normal form (normalization property), and whether all terms can reach at most one normal form (unique normalization property).
We study the decidability of these properties for two syntactically restricted classes of TRS: for (i) shallow right-linear TRS, and for (ii) linear right-shallow TRS.
We show that the normalization property is decidable for both cases (i) and (ii), and that the unique normalization property is undecidable for case (ii), whereas for case (i) remains unknown. Nevertheless, for case (i), if the normalization property is satisfied, then the unique normalization property becomes decidable. Hence, whether all terms reach exactly one normal form for TRS of kind (i) is decidable.
These results are based on known constructions of tree automata with constraints and rewrite closure, and on reducing the normalization property to normalization from a concrete finite set of terms.
The first author is supported by Spanish Min. of Educ. and Science by the LogicTools project (TIN2004-03382).
This is a preview of subscription content, log in via an institution to check access.
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
Bachmair, L.: Canonical Equational Proofs. Birkhäuser, Boston (1991)
Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: International Symposium on Theoretical Aspects of Computeter Science, pp. 161–171 (1992)
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on http://www.grappa.univ-lille3.fr/tata
Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science (Vol. B: Formal Models and Semantics), pp. 243–320, Amsterdam, North-Holland (1990)
Durand, I.: Call by need computations in orthogonal term rewriting systems, 07, Habilitation diriger des recherches de l’université de Bordeaux (2005)
Gilleron, R., Tison, S.: Regular tree languages and rewrite systems. Fundam. Inform. 24(1/2), 157–174 (1995)
Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Luke, C.-H. (ed.) CSL 2005. LNCS, vol. 3634, pp. 541–556. Springer, Heidelberg (2005)
Godoy, G., Tiwari, A.: Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules. In: Nieuwenhuis, R. (ed.) Automated Deduction – CADE-20. LNCS (LNAI), vol. 3632, pp. 164–176. Springer, Heidelberg (2005)
Godoy, G., Tiwari, A., Verma, R.: On the confluence of linear shallow term rewrite systems. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 85–96. Springer, Heidelberg (2003)
Godoy, G., Tiwari, A., Verma, R.: Deciding confluence of certain term rewriting systems in polynomial time. Annals of Pure and Applied Logic 130(1-3), 33–59 (2004)
Jacquemard, F.: Decidable approximations of term rewriting systems. In: Rewriting Techniques and Applications, 7th International Conference, pp. 362–376 (1996)
Levy, J., Agusti, J.: Bi-rewriting, a term rewriting technique for monotone order relations. In: Kirchner, C. (ed.) Rewriting Techniques and Applications. LNCS, vol. 690, pp. 17–31. Springer, Heidelberg (1993)
Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. Inf. Comput. 178(2), 499–514 (2002)
Tiwari, A.: Rewrite closure for ground and cancellative AC theories. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 2245, pp. 334–346. Springer, Heidelberg (2001)
Tiwari, A.: On the combination of equational and rewrite theories induced by certain term rewrite systems. Menlo Park, CA 94025 (2002), Available at: www.csl.sri.com/~tiwari/combinationER.ps
Verma, R., Hayrapetyan, A.: A new decidability technique for ground term rewriting systems. ACM Trans. Comput. Log. 6(1), 102–123 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Godoy, G., Tison, S. (2007). On the Normalization and Unique Normalization Properties of Term Rewrite Systems . In: Pfenning, F. (eds) Automated Deduction – CADE-21. CADE 2007. Lecture Notes in Computer Science(), vol 4603. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73595-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-73595-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73594-6
Online ISBN: 978-3-540-73595-3
eBook Packages: Computer ScienceComputer Science (R0)