Rapport Année : 1999

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

Résumé

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.

Domaines

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

Dates et versions

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

Licence

Identifiants

  • HAL Id : inria-00098750 , version 1

Citer

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⟩
261 Consultations
293 Téléchargements

Partager

  • More