Dependency Pairs and Polynomial Path Orders

Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime complexity of term rewrite systems and the polytime computability of those functions computed by these rewrite systems. The established techniques have been implemented and we provide ample experimental data to assess the new method.

• Type: Conference
• Year: 2009
• Where: RTA
• Authors: Martin Avanzini, Georg Moser
• Keywords: Polynomial Path Orders, Polynomial Runtime Complexity, Rewrite Systems, RTA 2009, Theoretical Computer Science