How to choose the weights in the Knuth Bendix ordering
on Rewriting techniques and applications
Proof methods for equational theories
Proof methods for equational theories
Journal of Symbolic Computation
Termination proofs and the length of derivations
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Termination Proofs by Context-Dependent Interpretations
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Orienting rewrite rules with the Knuth--Bendix order
Information and Computation - RTA 2001
Termination of String Rewriting Proved Automatically
Journal of Automated Reasoning
Relating derivation lengths with the slow-growing hierarchy directly
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Automation of recursive path ordering for infinite labelled rewrite systems
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
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
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Automated Complexity Analysis Based on the Dependency Pair Method
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Journal of Automated Reasoning
The Derivational Complexity Induced by the Dependency Pair Method
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Characterising space complexity classes via Knuth-Bendix orders
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
| Hi-index | 0.00 |
We study the derivational complexity of rewrite systems compatible with KBO, if the signature of is infinite. We show that the known bounds on the derivation height are preserved, if fulfils some mild conditions. This allows us to obtain bounds on the derivational height of non simply terminating TRSs. Furthermore, we re-establish the 2-recursive upper-bound on the derivational complexity of finite rewrite systems compatible with KBO.