Complexity characterisation of restrictions of KBO

Guillaume Bonfante 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Termination proofs of rewrite systems using the Knuth-Bendix ordering, {\sckbo}, imply multiply-recursive bounds on the lengths of derivations. Hofbauer has studied two restrictions of {\sc kbo}. The first is a restriction to the use of positive weights, the second is a restriction on the signature which is only allowed to contain at most unary symbols. In both cases, Hofbauer proves the derivation lengths to be bounded exponentially. We prove that it correspond exactly to computations in {\sc Linspace}. Under some further considerations, we give a caracterisation of {\sc Etime} with the help of the second type of computations.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/inria-00099196
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:51:41 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • HAL Id : inria-00099196, version 1

Collections

Citation

Guillaume Bonfante. Complexity characterisation of restrictions of KBO. Implicit computational complexity, J.Y. Marion, May 2000, Santa Barbara, US, 12 p. ⟨inria-00099196⟩

Share

Metrics

Record views

104