Abstract
In this chapter we will first sketch a proof of the well-known fact that termination is undecidable. In Chapter 6 this result will be strengthened in several respects. In Section 5.2 standard methods for proving termination are reviewed: Polynomial interpretations yield polynomial termination, whereas recursive path orderings show simple termination. As a matter of fact, there are several other properties related to termination that form the so-called termination hierarchy. We will review this hierarchy in Section 5.3. After that, some newer techniques for proving termination will be treated: the dependency pair method, semantic labeling, and type introduction. Finally, we will study innermost termination.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ohlebusch, E. (2002). Termination. In: Advanced Topics in Term Rewriting. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3661-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3661-8_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2921-1
Online ISBN: 978-1-4757-3661-8
eBook Packages: Springer Book Archive