An Improved Recursive Decomposition Ordering for Term Rewriting Systems Revisited

Authors:
Munehiro Iwami
Affiliations:
Faculty of Science and Engineering, Shimane University
Venue:
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
Year:
2005

Citing 11
Cited 0

Termination of rewriting

Journal of Symbolic Computation
Path of subterms ordering and recursive decomposition ordering revisited

Journal of Symbolic Computation
On the recursive decomposition ordering with lexicographical status and other related orderings

Journal of Automated Reasoning
Simple termination of rewrite systems

NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Term rewriting and all that

Term rewriting and all that
Proving termination with multiset orderings

Communications of the ACM
Advanced topics in term rewriting

Advanced topics in term rewriting
Computer experiments with the REVE term rewriting system generator

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Extensions and Comparison of Simplification Orderings

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
A Recursive Path Ordering for Higher-Order Terms in eta-Long beta-Normal Form

RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Simplification Orderings: History Of Results

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Simplification orderings, like the recursive path ordering and the improved recursive decomposition ordering, are widely used for proving the termination property of term rewriting systems. The improved recursive decomposition ordering is known as the most powerful simplification ordering. In this paper, we investigate the improved recursive decomposition ordering for proving termination of term rewriting systems. We completely show that the improved recursive decomposition ordering is closed under substitutions.