Recurrence with affine level mappings is P-time decidable for CLP (R)
F Mesnard, A Serebrenik - arXiv preprint cs/0701082, 2007 - arxiv.org
… 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. … For these domains we have identified a class of CLP
programs such that an affine level mapping is sufficient to prove their recurrence. We have
seen that membership to this class is …
can be proved by using affine level mappings. We show that membership to this class is
decidable in polynomial time. … For these domains we have identified a class of CLP
programs such that an affine level mapping is sufficient to prove their recurrence. We have
seen that membership to this class is …
Recurrence with affine level mappings is p-time decidable for clp
F Mesnard, A Serebrenik - Theory and Practice of Logic …, 2008 - cambridge.org
… 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. … For every rule r, say p( xp) ← c,q( xq), we test the
satisfiability of c. For the domains we consider, it can be done in polynomial time (Khachiyan
1979). If c is not satisfiable, we disregard this rule. …
can be proved by using affine level mappings. We show that membership to this class is
decidable in polynomial time. … For every rule r, say p( xp) ← c,q( xq), we test the
satisfiability of c. For the domains we consider, it can be done in polynomial time (Khachiyan
1979). If c is not satisfiable, we disregard this rule. …
Showing the best results for this search. See all results