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

Simple item page
dc.creatorMesnard, Fred
dc.creatorSerebrenik, Alexander
dc.date2007-01-12
dc.date.accessioned2026-07-07T07:40:23Z
dc.date.available2026-07-07T07:40:23Z
dc.descriptionIn 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.
dc.descriptionTo appear in Theory and Practice of Logic Programming (TPLP)
dc.identifierhttps://arxiv.org/abs/cs/0701082
dc.identifierhttp://arxiv.org/abs/cs/0701082
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/121760
dc.subjectProgramming Languages
dc.subjectLogic in Computer Science
dc.subjectD.1.6; F.3.2
dc.titleRecurrence with affine level mappings is P-time decidable for CLP(R)
dc.typetext

Files

Collections

arXiv