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

F. Mesnard; A. Serebrenik

doi:10.1017/S1471068407003122

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

F. Mesnard, A. Serebrenik

Research output: Contribution to journal › Article › Academic › peer-review

15 Citations (Scopus)

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	https://doi.org/10.1017/S1471068407003122
Publication status	Published - 2008

Access to Document

10.1017/S1471068407003122

Cite this

@article{cc810ccd288e4534bbe6832b98bd11fa,

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

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.",

author = "F. Mesnard and A. Serebrenik",

year = "2008",

doi = "10.1017/S1471068407003122",

language = "English",

volume = "8",

pages = "111--119",

journal = "Theory and Practice of Logic Programming",

issn = "1471-0684",

publisher = "Cambridge University Press",

number = "1",

}

TY - JOUR

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

AU - Mesnard, F.

AU - Serebrenik, A.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

U2 - 10.1017/S1471068407003122

DO - 10.1017/S1471068407003122

M3 - Article

SN - 1471-0684

VL - 8

SP - 111

EP - 119

JO - Theory and Practice of Logic Programming

JF - Theory and Practice of Logic Programming

IS - 1

ER -

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

Abstract

Access to Document

Fingerprint

Cite this