Recurrence with affine level mappings is P-time decidable for CLP(R)
Frédéric Mesnard, Alexander Serebrenik · arXiv (Cornell University) · 2007
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.