A Path Order for Rewrite Systems that Compute Exponential Time Functions (Technical Report)

In this paper we present a new path order for rewrite systems, the exponential path order EPOSTAR. Suppose a term rewrite system is compatible with EPOSTAR, then the runtime complexity of this rewrite system is bounded from above by an exponential function. Furthermore, the class of function computed by a rewrite system compatible with EPOSTAR equals the class of functions computable in exponential time on a Turing maschine.

[1]  Stephen A. Cook,et al.  A new recursion-theoretic characterization of the polytime functions (extended abstract) , 1992, STOC '92.

[2]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[3]  Georg Moser,et al.  Complexity Analysis by Rewriting , 2008, FLOPS.

[4]  Pierre Lescanne,et al.  Polynomial Interpretations and the Complexity of Algorithms , 1992, CADE.

[5]  Toshiyasu Arai,et al.  A new function algebra of EXPTIME functions by safe nested recursion , 2006, TOCL.

[6]  Maria da Conceição Fernández Ferreira.  Termination of term rewriting : well-foundedness, totality and transformations , 1995 .

[7]  Detlef Plump,et al.  Essentials of Term Graph Rewriting , 2002, GETGRATS Closing Workshop.

[8]  Hans Zantema,et al.  Matrix Interpretations for Proving Termination of Term Rewriting , 2006, Journal of Automated Reasoning.

[9]  Naohi Eguchi.  A lexicographic path order with slow growing derivation bounds , 2009, Math. Log. Q..

[10]  Dieter Hofbauer.  Termination proofs and derivation lengths in term rewriting systems , 1992 .

[11]  Guillaume Bonfante,et al.  Quasi-interpretations a way to control resources , 2011, Theor. Comput. Sci..

[12]  Guillaume Bonfante,et al.  Characterising Space Complexity Classes via Knuth-Bendix Orders , 2010, LPAR.

[13]  Georg Moser,et al.  Automated Complexity Analysis Based on the Dependency Pair Method , 2008, IJCAR.

[14]  Ugo Dal Lago,et al.  On Constructor Rewrite Systems and the Lambda-Calculus , 2009, ICALP.

[15]  Stephen A. Cook,et al.  A new recursion-theoretic characterization of the polytime functions , 1992, STOC '92.

[16]  Georg Moser,et al.  Closing the Gap Between Runtime Complexity and Polytime Computability , 2010, RTA.

[17]  Jürgen Giesl,et al.  Implementing RPO and POLO using SAT , 2007, Deduction and Decision Procedures.

[18]  Enno Ohlebusch,et al.  Term Rewriting Systems , 2002 .

[19]  Daniel Leivant,et al.  Stratified functional programs and computational complexity , 1993, POPL '93.

[20]  Neil D. Jones,et al.  Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time , 2008, CiE.

[21]  Derick Wood,et al.  Theory of computation , 1986 .

[22]  Dieter Hofbauer,et al.  Termination Proofs and the Length of Derivations (Preliminary Version) , 1989, RTA.

[23]  Patrick Baillot,et al.  Guest editorial: Special issue on implicit computational complexity , 2009, TOCL.

[24]  Toshiyasu Arai,et al.  Proofs of Termination of Rewrite Systems for Polytime Functions , 2005, FSTTCS.

[25]  Jean-Yves Marion,et al.  Analysing the implicit complexity of programs , 2003, Inf. Comput..

[26]  Guillaume Bonfante,et al.  Algorithms with polynomial interpretation termination proof , 2001, Journal of Functional Programming.

[27]  Michèle Soria,et al.  Complexity Analysis of Term-Rewriting Systems , 1989, Theor. Comput. Sci..

[28]  Georg Moser,et al.  Proof Theory at Work: Complexity Analysis of Term Rewrite Systems , 2009, ArXiv.