Abstract
In this paper, two topics will be examined. First, the general path ordering will be applied to three conditional rewrite systems to show termination. Second, the relationship between forward closures and innermost rewriting will be discussed. This leads one to consider completion limited to innermost derivations. The ability to easily extend innermost and outermost forward closures is examined.
This research was supported in part by the U. S. National Science Foundation under Grants CCR-90-07195, INT-90-169587, and CCR-90-24271.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Nachum Dershowitz. Termination of rewriting. J. Symbolic Computation, 3(1&2):69–115, February/April 1987. Corrigendum: 4, 3 (December 1987), 409–410; reprinted in Rewriting Techniques and Applications, J.-P. Jouannaud, ed., pp. 69–115, Academic Press, 1987.
Nachum Dershowitz and Charles Hoot. Topics in termination. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), Lecture Notes in Computer Science, Berlin, June 1993. Springer-Verlag.
Nachum Dershowitz and Charles Hoot. Natural termination. Theoretical Computer Science, 142:179–207, May 1995.
Oliver Geupel. Overlap closures and termination of term rewriting systems. Report MIP-8922, Universität Passau, Passau, West Germany, July 1989.
Bernhard Gramlich. On termination, innermost termination and completeness of heirarchically structured rewrite systems. Technical Report SR-93-09, SEKI, Universitat Kaiserslautern, 1993.
A. Martelli, C. Moiso and G. F. Rossi. An algorithm for unification in equational theories. In IEEE Symposium on Logic in Computer Science, Salt Lake City, UT, September 1986.
Aart Middeldorp. Modular properties of term rewriting systems. PhD thesis, Free University, Amsterdam, 1990.
David A. Plaisted. Term rewriting systems. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4, chapter 2. Oxford University Press, Oxford, 1993. To appear.
Yoshihito Toyama, Jan Willem Klop, and Hendrik Pieter Barendregt. Termination for the direct sum of left-linear term rewriting systems. In Nachum Dershowitz, editor, Proceedings of the Third International Conference on Rewriting Techniques and Applications (Chapel Hill, NC), volume 355 of Lecture Notes in Computer Science, pages 477–491, Berlin, April 1989. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoot, C. (1995). Termination for restricted derivations and conditional rewrite systems. In: Dershowitz, N., Lindenstrauss, N. (eds) Conditional and Typed Rewriting Systems. CTRS 1994. Lecture Notes in Computer Science, vol 968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60381-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-60381-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60381-8
Online ISBN: 978-3-540-45513-4
eBook Packages: Springer Book Archive