Modular Complexity Analysis via Relative Complexity
Harald Zankl, Martin Korp · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2010
In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining different criteria. All current investigations to analyze the derivational complexity are based on a single termination proof, possibly preceded by transformations. We prove that the modular framework is strictly more powerful than the conventional setting. Furthermore, the results have been implemented and experiments show significant gains in power.