Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Journal of Symbolic Computation
A total AC-compatible ordering based on RPO
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Automatically Proving Termination Where Simplification Orderings Fail
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Modularity of Termination Using Dependency pairs
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
System Description: The Dependency Pair Method
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Dummy Elimination in Equational Rewriting
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Termination of Associative-Commutative Rewriting by Dependency Pairs
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Positive Deduction modulo Regular Theories
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Termination of a Set of Rules Modulo a Set of Equations
Proceedings of the 7th International Conference on Automated Deduction
Simplification Orderings: History Of Results
Fundamenta Informaticae
Dependency Pairs for Rewriting with Non-free Constructors
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Effectively Checking the Finite Variant Property
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
A dependency pair framework for A∨C-termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Folding variant narrowing and optimal variant termination
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A Maude coherence checker tool for conditional order-sorted rewrite theories
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Incremental checking of well-founded recursive specifications modulo axioms
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
AC completion with termination tools
CADE'11 Proceedings of the 23rd international conference on Automated deduction
| Hi-index | 0.00 |
The dependency pair technique of Arts and Giesl [1, 2, 3] for termination proofs of term rewrite systems (TRSs) is extended to rewriting modulo equations. Up to now, such an extension was only known in the special case of AC-rewriting [15, 17]. In contrast to that, the proposed technique works for arbitrary non-collapsing equations (satisfying a certain linearity condition). With the proposed approach, it is now possible to perform automated termination proofs for many systems where this was not possible before. In other words, the power of dependency pairs can now also be used for rewriting modulo equations.