Recurrence with affine level mappings is P-time decidable for CLP(R)
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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.
To appear in Theory and Practice of Logic Programming (TPLP)
To appear in Theory and Practice of Logic Programming (TPLP)