Recurrence with affine level mappings is P-time decidable for CLP(R) - Université de La Réunion Access content directly
Journal Articles TPLP Year : 2008
No file

Dates and versions

hal-01186188 , version 1 (24-08-2015)

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⟩
94 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More