Reducing Right-Hand Sides for Termination

We propose two transformations on term rewrite systems (TRSs) based on reducing right-hand sides: one related to the transformation order and a variant of dummy elimination. Under mild conditions we prove that the transformed system is terminating if and only if the original one is terminating. Both...

Full description

Saved in:
Bibliographic Details
Published inProcesses, Terms and Cycles: Steps on the Road to Infinity pp. 173 - 197
Main Author Zantema, Hans
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
SeriesLecture Notes in Computer Science
Subjects
Basic Procedure
Critical Pair
Normal Form
Single Rule
Termination Proof
Online AccessGet full text
ISBN354030911X
9783540309116
ISSN0302-9743
1611-3349
DOI10.1007/11601548_12

Cover

More Information
Summary:We propose two transformations on term rewrite systems (TRSs) based on reducing right-hand sides: one related to the transformation order and a variant of dummy elimination. Under mild conditions we prove that the transformed system is terminating if and only if the original one is terminating. Both transformations are very easy to implement, and make it much easier to prove termination of some TRSs automatically.
ISBN:354030911X
9783540309116
ISSN:0302-9743
1611-3349
DOI:10.1007/11601548_12