The Derivational Complexity Induced by the Dependency Pair Method

DOI10.2168/LMCS-7(3:1)2011zbMath1237.68109MaRDI QIDQ5895523

Georg Moser, Andreas Schnabl

Publication date: 2 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

terminationdependency pair methodterminating term rewriting systemderivational complexity analysis

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (8)

Higher-order interpretations and program complexity ⋮ Unnamed Item ⋮ Lower bounds for runtime complexity of term rewriting ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations ⋮ Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems ⋮ Applications and extensions of context-sensitive rewriting ⋮ The Derivational Complexity Induced by the Dependency Pair Method ⋮ Derivational complexity and context-sensitive Rewriting

Uses Software

• Tyrolean

This page was built for publication: The Derivational Complexity Induced by the Dependency Pair Method