Commutation, transformation, and termination
Proc. of the 8th international conference on Automated deduction
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Journal of Symbolic Computation
On the recursive decomposition ordering with lexicographical status and other related orderings
Journal of Automated Reasoning
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Termination for direct sums of left-linear complete term rewriting systems
Journal of the ACM (JACM)
A calculational approach to mathematical induction
Theoretical Computer Science
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Proving termination with multiset orderings
Communications of the ACM
Termination of Linear Rewriting Systems (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Polynomial Time Termination and Constraint Satisfaction Tests
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Well-Founded Recursive Relations
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Well-foundedness of Term Orderings
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
The Higher-Order Recursive Path Ordering
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Termination of abstract reduction systems
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Program termination and well partial orderings
ACM Transactions on Computational Logic (TOCL)
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
| Hi-index | 5.23 |
Combinatorial commutation properties for reordering a sequence consisting of two kinds of steps, and for separating the well-foundedness of their combination into well-foundedness of each, are investigated. A weak commutation property, called ''jumping'', along with a weakened version of the lifting property, called ''escaping'' and requiring only an eventual lifting, are used for proving well-foundedness of a generic, abstract version of the recursive path orderings.