On recursive path ordering

DOI10.1016/0304-3975(85)90175-6zbMath0602.68031OpenAlexW2055323844MaRDI QIDQ1082075

Mukkai S. Krishnamoorthy, Paliath Narendran

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90175-6

zbMATH Keywords

terminationterm rewriting systemswell-founded partial order

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (12)

Open problems in rewriting ⋮ Termination of string rewriting proved automatically ⋮ SAT solving for termination proofs with recursive path orders and dependency pairs ⋮ AC-KBO revisited ⋮ Practical algorithms for deciding path ordering constraint satisfaction. ⋮ Orienting rewrite rules with the Knuth-Bendix order. ⋮ The Computability Path Ordering: The End of a Quest ⋮ On the complexity of recursive path orderings ⋮ Quasi-interpretations. A way to control resources ⋮ Proving Termination with (Boolean) Satisfaction ⋮ The size-change principle and dependency pairs for termination of term rewriting ⋮ Simplification orderings: Putting them to the test

Uses Software

• RRL
• REVE

Cites Work

• Orderings for term-rewriting systems
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On recursive path ordering