Commutation, transformation, and termination
Proc. of the 8th international conference on Automated deduction
Full-commutation and fair-termination in equational (and combined) term-rewriting systems
Proc. of the 8th international conference on Automated deduction
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
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
Expanding Extensional Polymorphism
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Modular Termination of Term Rewriting Systems Revisited
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Termination of Linear Rewriting Systems (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
On a Duality Between Kruskal and Dershowitz Theorems
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
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)
HORPO with computability closure: a reconstruction
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
| Hi-index | 0.00 |
We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating well-foundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used in termination proofs.