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 metadatas
https://hal.univ-reunion.fr/hal-01186188
Contributor : Nicolas Alarcon <>
Submitted on : Monday, August 24, 2015 - 2:29:52 PM
Last modification on : Tuesday, May 5, 2020 - 11:50:16 AM

Identifiers

  • HAL Id : hal-01186188, version 1

Collections

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

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

Share

Metrics

Record views

184