Reducing right-hand sides for termination

Authors:
Hans Zantema
Affiliations:
Department of Computer Science, TU Eindhoven, Eindhoven, The Netherlands
Venue:
Processes, Terms and Cycles
Year:
2005

Citing 12
Cited 6

Termination of rewriting systems by polynomial interpretations and its implementation

Science of Computer Programming
Termination of term rewriting: interpretation and type elimination

Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Term rewriting and all that

Term rewriting and all that
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Simplifying termination proofs for rewrite systems by preprocessing

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Automatic Termination Proofs With Transformation Orderings

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Dummy Elimination in Equational Rewriting

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Dummy Elimination: Making Termination Easier

FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Transforming Termination by Self-Labelling

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Eliminating Dummy Elimination

CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Termination of String Rewriting Proved Automatically

Journal of Automated Reasoning
Termination Of Term Rewriting By Semantic Labelling

Fundamenta Informaticae

Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Increasing Interpretations

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Increasing interpretations

Annals of Mathematics and Artificial Intelligence
Cdiprover3: a tool for proving derivational complexities of term rewriting systems

ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Matrix interpretations for proving termination of term rewriting

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
TPA: termination proved automatically

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.