Abstract
In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time.
| Original language | English |
|---|---|
| Pages (from-to) | 111-119 |
| Journal | Theory and Practice of Logic Programming |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2008 |
Fingerprint
Dive into the research topics of 'Recurrence with affine level mappings is P-time decidable for CLP(R)'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver