Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features
Information and Computation
Predictive Labeling with Dependency Pairs Using SAT
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Automation of recursive path ordering for infinite labelled rewrite systems
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Search Techniques for Rational Polynomial Orders
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rules. A variant of semantic labeling is predictive labeling where the quasi-model condition is only required for the usable rules. In this paper we investigate how semantic and predictive labeling can be used to prove innermost termination. Moreover, we show how to reduce the set of usable rules for predictive labeling even further, both in the termination and the innermost termination case.