On the complexity of recursive path orderings

DOI10.1016/0020-0190(93)90105-IzbMath0778.68045OpenAlexW2041678518MaRDI QIDQ685537

Wayne Snyder

Publication date: 9 January 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90105-i

zbMATH Keywords

ground caseKnuth-Bendix procedurepath ordering

Mathematics Subject Classification ID

Related Items (1)

The complexity of counting problems in equational matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On recursive path ordering
• Termination of rewriting
• Path of subterms ordering and recursive decomposition ordering revisited
• Proving refutational completeness of theorem-proving strategies

This page was built for publication: On the complexity of recursive path orderings