Systems of reductions
Termination proofs and the length of derivations
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Automating the Knuth Bendix ordering
Acta Informatica
Time bounded rewrite systems and termination proofs by generalized embedding
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
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
Deduction and declarative programming
Deduction and declarative programming
On the conjecture of Yves Me´tivier
Theoretical Computer Science - Special issue on number theory, combinatorics and applications to computer science
Termination of term rewriting: interpretation and type elimination
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Complexity bounds for some finite forms of Kruskal's theorem
Journal of Symbolic Computation
Ordinal recursive bounds for Higman's theorem
Theoretical Computer Science
Term rewriting and all that
Encoding the Hydra Battle as a Rewrite System
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A Complex Example of a Simplifying Rewrite System
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
How to Choose Weights in the Knuth Bendix Ordering
RTA '87 Proceedings of the 2nd International Conference on Rewriting Techniques and Applications
Canonical Forms in Finitely Presented Algebras
Proceedings of the 7th International Conference on Automated Deduction
Removing redundant arguments automatically
Theory and Practice of Logic Programming
| Hi-index | 0.01 |
The derivational complexity of a terminating rewrite system is a measure for the maximal length of rewrite sequences. We study the influence of certain standard termination criteria on the derivational complexity. In this paper we prove a uniform multiple recursive upper bound for Knuth-Bendix orderings. This continues work by Hofbauer and Lautemann [13], where it has been shown that primitive recursive bounds are impossible.