Light Multiset path ordering and Ptime - Two is better than one - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1999

Light Multiset path ordering and Ptime - Two is better than one

Abstract

We consider term rewriting systems as a general setting for studying algorithms. We construct a termination ordering, called light multiset path ordering (LMPO), which is a restriction of the multiset path ordering. We establish that the class of programs on words which is terminating by LMPO, characterises exactly the functions computable in polynomial time.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
99-R-106.pdf (259.03 Ko) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00098750 , version 1

Cite

Jean-Yves Marion. Light Multiset path ordering and Ptime - Two is better than one. [Intern report] 99-R-106 || marion99b, 1999, 19 p. ⟨inria-00098750⟩
126 View
70 Download

Share

Gmail Facebook Twitter LinkedIn More