Complexity characterisation of restrictions of KBO - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Complexity characterisation of restrictions of KBO


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.


Other [cs.OH]
No file

Dates and versions

inria-00099196 , version 1 (26-09-2006)


  • HAL Id : inria-00099196 , version 1


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


Gmail Facebook X LinkedIn More