Derivational Complexity of Knuth-Bendix Orders Revisited

DOI10.1007/11916277_6zbMath1165.68391OpenAlexW1517054919MaRDI QIDQ5387885

Georg Moser

Publication date: 27 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11916277_6

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

KBO orientability, Proving Quadratic Derivational Complexities Using Context Dependent Interpretations, Automated Complexity Analysis Based on the Dependency Pair Method, The Hydra battle and Cichon's principle, Complexity Analysis by Rewriting, The Derivational Complexity Induced by the Dependency Pair Method

Uses Software

• Tyrolean
• AProVE