Recurrence with affine level mappings is P-time decidable for CLP(R)
classification
💻 cs.PL
cs.LO
keywords
affineclassdecidablelevelmappingsconstraintintroducelogic
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.