Recurrence with affine level mappings is P-time decidable for CLP(R)
Abstract
no abstract
Journal Articles
TPLP
Year : 2008
Nicolas Alarcon : Connect in order to contact the contributor
https://hal.univ-reunion.fr/hal-01186188
Submitted on : Monday, August 24, 2015-2:29:52 PM
Last modification on : Friday, January 21, 2022-3:27:04 AM
Dates and versions
Identifiers
- HAL Id : hal-01186188 , version 1
Cite
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⟩
Collections
92
View
0
Download