Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T06:36:12.107Z Has data issue: false hasContentIssue false

Recurrence with affine level mappings is P-time decidable for CLP$({\mathbb R})$

Published online by Cambridge University Press:  01 January 2008

FRED MESNARD
Affiliation:
IREMIA, Université de la Réunion, France (email: Frederic.Mesnard@univ-reunion.fr)
ALEXANDER SEREBRENIK
Affiliation:
Laboratory for Quality Software (LaQuSo), T.U. Eindhoven, The Netherlands (email: A.Serebrenik@tue.nl)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Technical Note
Copyright
Copyright © Cambridge University Press 2007