Proofs of termination of rewrite systems for polytime functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3821 LNCS, Issue , 2005, Pages 529-540

  Arai, Toshiyasu ^a   Moser, Georg ^b  

^a KOBE UNIVERSITY   (Japan)

^b UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

Complexity theory; Derivation length; Term rewriting characterisation; Termination

Indexed keywords

COMPLEXITY THEORY; DERIVATION LENGTH; TERM REWRITING CHARACTERISATION; TERMINATION;

COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIALS;

MOTION PLANNING;

EID: 33744922659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_43     Document Type: Conference Paper

References (11)

1. Beckmann, A., Weiermann, A.: A term rewriting characterization of the polytime functions and related complexity classes. Archive for Mathematical Logic 36 (1996) 11-30
2. Cichon, E.A., Weiermann, A.: Term rewriting theory for the primitive recursive functions. Annals of Pure and Applied Logic 83 (1997) 199-223
3. Oitavem, I.: A term rewriting characterization of the functions computable in polynomal space. Archive for Mathematical Logic 41 (2002) 35-47
4. Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-intepretations and small space bounds. In: Proceedings of RTA'2005. (2005) 150-164
5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge Univeristy Press (1998)
6. Cobham, A.: The intrinsic computational difficulty of functions. In Bar-Hillel, Y., ed.: Logic, Methodology and Philosophy of Science, proceedings of the second International Congress, Jerusalem, 1964, North-Holland (1965)
7. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions. Comput. Complexity 2 (1992) 97-110
8. Aral, T., Moser, G.: A note on a term rewriting characterization of PTIME. In: Proc. of WST'2004. (2004) 10-13 Extended Abstract.
9. Buchholz, W.: Proof-theoretical analysis of termination proofs. Annals of Pure and Applied Logic 75 (1995) 57-65
10. Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. TCS 105 (1992) 129-140
11. Marion, J.: Analysing the implicit complexity of programs. Information and Computation 183 (2003) 2-18