Proc. of the first international conference on Rewriting techniques and applications
Path of subterms ordering and recursive decomposition ordering revisited
Proc. of the first international conference on Rewriting techniques and applications
Proc. of the first international conference on Rewriting techniques and applications
A procedure for automatically proving the termination of a set of rewrite rules
Proc. of the first international conference on Rewriting techniques and applications
Theoretical Computer Science
Termination orderings for associative-commutative rewriting systems
Journal of Symbolic Computation
Function definitions in term rewriting and applicative programming
Information and Control
Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
A path ordering for proving termination of term rewriting systems
Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85)
Commutation, transformation, and termination
Proc. of the 8th international conference on Automated deduction
Proving termination of associative commutative rewriting systems by rewriting
Proc. of the 8th international conference on Automated deduction
A simple non-termination test for the Knuth-Bendix method
Proc. of the 8th international conference on Automated deduction
How to choose the weights in the Knuth Bendix ordering
on Rewriting techniques and applications
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Proof methods for equational theories
Proof methods for equational theories
Termination proofs and the length of derivations
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
A geometrical approach to multiset orderings
Theoretical Computer Science
A sufficient condition for the termination of the direct sum of term rewriting systems
Proceedings of the Fourth Annual Symposium on Logic in computer science
On the recursive decomposition ordering with lexicographical status and other related orderings
Journal of Automated Reasoning
Improving associative path orderings
CADE-10 Proceedings of the tenth international conference on Automated deduction
Automating the Knuth Bendix ordering
Acta Informatica
A new method for proving termination of AC-rewrite systems
FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Time bounded rewrite systems and termination proofs by generalized embedding
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Any ground associative-commutative theory has a finite canonical system
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
Associative-commutative reduction orderings
Information Processing Letters
On the complexity of recursive path orderings
Information Processing Letters
Handbook of logic in computer science (vol. 2)
Proving termination with multiset orderings
Communications of the ACM
Termination of Rewriting is Undecidable in the One-Rule Case
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Term Orderings on the Polynominal Ring
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Extensions and Comparison of Simplification Orderings
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Polynomial Time Termination and Constraint Satisfaction Tests
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Simple Termination is Difficult
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
A Precedence-Based Total AC-Compatible Ordering
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Linear Interpretations by Counting Patterns
RTA '93 Proceedings of the 5th 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
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths
Proceedings of the Second International Conference on Algebraic and Logic Programming
AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering
Proceedings of the Second International Conference on Algebraic and Logic Programming
Generalized Sufficient Conditions for Modular Termination of Rewriting
Proceedings of the Third International Conference on Algebraic and Logic Programming
Termination of Rewrite Systems by Elementary Interpretations
Proceedings of the Third International Conference on Algebraic and Logic Programming
Polynomial Interpretations and the Complexity of Algorithms
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Termination of Term Rewriting by Interpretation
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Path Orderings for Termination of Associative-Commutative Rewriting
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Termination of a Set of Rules Modulo a Set of Equations
Proceedings of the 7th International Conference on Automated Deduction
A PROGRAM FOR GENERATING AND ANALYZING TERM REWRITING SYSTEMS
A PROGRAM FOR GENERATING AND ANALYZING TERM REWRITING SYSTEMS
Orderings for term-rewriting systems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Decomposition ordering at a tool to prove the termination of rewriting systems
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Associative-commutative rewriting
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Simple termination of context-sensitive rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Induction Proofs with Partial Functions
Journal of Automated Reasoning
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Transforming Context-Sensitive Rewrite Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Dependency Pairs for Equational Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Applying Rewriting Techniques to the Verification of Erlang Processes
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Decidable Classes of Inductive Theorems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Algorithms with polynomial interpretation termination proof
Journal of Functional Programming
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Termination of just/fair computations in term rewriting
Information and Computation
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
An Improved Recursive Decomposition Ordering for Term Rewriting Systems Revisited
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Detecting non-termination of term rewriting systems using an unfolding operator
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Goal-directed and relative dependency pairs for proving the termination of narrowing
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
We focus on termination proof techniques for unconditional term rewriting systems using simplification orderings. Throughout the last few years numerous (simplification) orderings have been defined by various authors. This paper provides an overview on different aspects of these techniques. Additionally, we introduce a formalism that allows clear representations of orderings.