Termination proofs and the length of derivations
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Methods and Applications of (MAX, +) Linear Algebra
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Tyrolean termination tool: Techniques and features
Information and Computation
Matrix Interpretations for Proving Termination of Term Rewriting
Journal of Automated Reasoning
Proving Termination by Bounded Increase
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Termination by quasi-periodic interpretations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Certification of proving termination of term rewriting by matrix interpretations
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Weighted automata for proving termination of string rewriting
Journal of Automata, Languages and Combinatorics
TPA: termination proved automatically
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination of string rewriting with matrix interpretations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The Derivational Complexity Induced by the Dependency Pair Method
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Improved Matrix Interpretation
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Cdiprover3: a tool for proving derivational complexities of term rewriting systems
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Characterising space complexity classes via Knuth-Bendix orders
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Joint spectral radius theory for automated complexity analysis of rewrite systems
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
| Hi-index | 0.00 |
We introduce the arctic matrix method for automatically proving termination of term rewriting. We use vectors and matrices over the arctic semi-ring: natural numbers extended with -驴,with the operations "max" and "plus". This extends the matrix method for term rewriting and the arctic matrix method for string rewriting. In combination with the Dependency Pairs transformation, this allows for some conceptually simple termination proofs in cases where only much more involved proofs were known before. We further generalize to arctic numbers "below zero": integers extended with -驴.This allows to treat some termination problems with symbols that require a predecessor semantics. The contents of the paper has been formally verified in the Coqproof assistant and the formalization has been contributed to the CoLoRlibrary of certified termination techniques. This allows formal verification of termination proofs using the arctic matrix method. We also report on experiments with an implementation of this method which, compared to results from 2007, outperforms TPA(winner of the certified termination competition for term rewriting), and in the string rewriting category is as powerful as Matchboxwas but now all of the proofs are certified.