HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Recurrence with affine level mappings is P-time decidable for CLP(R)

Frédéric Mesnard 1, 2 Alexander Serebrenik 3
1 IREMIA - Institut de REcherche en Mathématiques et Informatique Appliquées
2 LIM - Laboratoire d'Informatique et de Mathématiques
3 LIASD - Laboratoire d'Informatique Avancée de Saint-Denis
Abstract : no abstract
Document type :
Journal articles
Complete list of metadata
https://hal.univ-reunion.fr/hal-01186188
Contributor : Nicolas Alarcon Connect in order to contact the contributor
Submitted on : Monday, August 24, 2015 - 2:29:52 PM
Last modification on : Friday, January 21, 2022 - 3:27:04 AM

Identifiers

  • HAL Id : hal-01186188, version 1

Collections

UNIV-REUNION | UNIV-PARIS8 | INSMI | LIASD | LIM | FST-REUNION | UNIV-PARIS-LUMIERES | AFRIQ

Citation

Frédéric Mesnard, Alexander Serebrenik. Recurrence with affine level mappings is P-time decidable for CLP(R). TPLP, 2008, 8 (1), pp.111-119. ⟨hal-01186188⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

89