24 citations · 26 across the 2 of their papers we have counts for
2 papers
cs.LO2011★ 2 cited
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
Georg Moser, Andreas Schnabl
We study the derivational complexity of rewrite systems whose termination is provable in the dependency pair framework using the processors for reduction pairs, dependency graphs,…
cs.LO2009★ 24 cited
The Derivational Complexity Induced by the Dependency Pair Method
Georg Moser, Andreas Schnabl
We study the derivational complexity induced by the dependency pair method, enhanced with standard refinements. We obtain upper bounds on the derivational complexity induced by the…