Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Transforming Termination by Self-Labelling
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Match-Bounded String Rewriting Systems
Applicable Algebra in Engineering, Communication and Computing
On tree automata that certify termination of left-linear term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
TPA: termination proved automatically
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Innermost Termination of Rewrite Systems by Labeling
Electronic Notes in Theoretical Computer Science (ENTCS)
Predictive Labeling with Dependency Pairs Using SAT
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
On the relation between sized-types based termination and semantic labelling
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Automation of recursive path ordering for infinite labelled rewrite systems
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Hi-index | 0.00 |
Semantic labeling is a transformation technique for proving the termination of rewrite systems. The semantic part is given by a quasi-model of the rewrite rules. In this paper we present a variant of semantic labeling in which the quasi-model condition is only demanded for the usable rules induced by the labeling. Our variant is less powerful in theory but maybe more useful in practice.