Jumping and escaping: modular termination and the abstract path ordering
From MaRDI portal
Publication:1929229
DOI10.1016/j.tcs.2012.09.013zbMath1253.68193OpenAlexW2099381364MaRDI QIDQ1929229
Publication date: 7 January 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.013
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orderings for term-rewriting systems
- Natural termination
- Termination by completion
- On the recursive decomposition ordering with lexicographical status and other related orderings
- Termination of rewriting
- Counterexamples to termination for the direct sum of term rewriting systems
- A calculational approach to mathematical induction
- An improved general path order
- Termination of term rewriting using dependency pairs
- The Computability Path Ordering: The End of a Quest
- TERMINATION OF ABSTRACT REDUCTION SYSTEMS
- Proving termination with multiset orderings
- Termination for direct sums of left-linear complete term rewriting systems
- On the union of well-founded relations
- Polynomial time termination and constraint satisfaction tests
- Program termination and well partial orderings
- Logic Programming
This page was built for publication: Jumping and escaping: modular termination and the abstract path ordering
