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 transformations are very easy to implement, and make it much easier to prove termination of some TRSs automatically.

• Type: Conference
• Year: 2005
• Where: BIRTHDAY
• Authors: Hans Zantema
• Keywords: Applied Computing, BIRTHDAY 2005, Dummy Elimination, Right Hand, Term Rewrite Systems