Abstract.
It is shown that finite terminating ground term rewrite systems have linearly bounded derivational complexity. This is proven via some suitable interpretation into the natural numbers. Terminating ground systems are not necessarily totally terminating, i.e., a strictly monotone interpretation into a well-order might not exist. We show, however, that those systems are almostω-terminating in the sense that such an interpretation into the sum of a finite partial order and the natural numbers always effectively exists. Finally, we show that for ground systems total termination is equivalent to ω-termination, and that this is a decidable property.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: December 8, 1999
Rights and permissions
About this article
Cite this article
Hofbauer, D. Termination Proofs for Ground Rewrite Systems – Interpretations and Derivational Complexity. AAECC 12, 21–38 (2001). https://doi.org/10.1007/s002000100062
Issue Date:
DOI: https://doi.org/10.1007/s002000100062