On recursive path ordering

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

Paliath Narendran, Mukkai S. Krishnamoorthy

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

termination; term rewriting systems; well-founded partial order

Mathematics Subject Classification ID

68Q65: Abstract data types; algebraic specification

Related Items

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

Uses Software

• RRL
• REVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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