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

Frédéric Mesnard, Alexander Serebrenik (2008)

> Home

Details and statistics

DOI: 10.1017/S1471068407003122

access: closed

type: Journal Article

metadata version: 2020-02-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tplp/MesnardS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tplp/MesnardS08
Frédéric Mesnard, Alexander Serebrenik:
Recurrence with affine level mappings is P-time decidable for CLP(R). Theory Pract. Log. Program. 8(1): 111-119 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.