Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

RTA
2009
Springer

favoriteEmaildiscussreport

122views Theoretical Computer Science» more RTA 2009»

Dependency Pairs and Polynomial Path Orders

14 years 5 months ago

Dependency Pairs and Polynomial Path Orders

Download cl-informatik.uibk.ac.at

Abstract. We show how polynomial path orders can be employed efﬁciently 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.

Martin Avanzini, Georg Moser

Real-time Traffic

Polynomial Path Orders | Polynomial Runtime Complexity | Rewrite Systems | RTA 2009 | Theoretical Computer Science |

claim paper

Related Content

» The Derivational Complexity Induced by the Dependency Pair Method

» Predictive Labeling with Dependency Pairs Using SAT

» The sizechange principle and dependency pairs for termination of term rewriting

» Search Techniques for Rational Polynomial Orders

» TORPA Termination of Rewriting Proved Automatically

» Proving Termination Using Recursive Path Orders and SAT Solving

» Orderings for Innermost Termination

» Implementing RPO and POLO using SAT

» Termination Analysis of Logic Programs Based on Dependency Graphs

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	RTA
Authors	Martin Avanzini, Georg Moser

Comments (0)