2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/121760In 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.To appear in Theory and Practice of Logic Programming (TPLP)Programming LanguagesLogic in Computer ScienceD.1.6; F.3.2text