Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Hierarchical termination revisited
Information Processing Letters
Context-sensitive rewriting strategies
Information and Computation
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
System Description: The Dependency Pair Method
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Automatic Termination Proofs With Transformation Orderings
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Complete Monotonic Semantic Path Orderings
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Elimination Transformations for Associative---Commutative Rewriting Systems
Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features
Information and Computation
Practical use of polynomials over the reals in proofs of termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Matrix Interpretations for Proving Termination of Term Rewriting
Journal of Automated Reasoning
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Journal of Automated Reasoning
Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Certification of Termination Proofs Using CeTA
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Information and Computation
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area in the past few years. The dependency pair method of Arts and Giesl is one of the most popular such methods. However, there are several obstacles that hamper its automation. In this paper we present new ideas to overcome these obstacles. We provide ample numerical data supporting our ideas.