Recurrence with affine level mappings is P-time decidable for CLP(R)
Programming Languages
2007-05-23 v1 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.cs/0701082,
title = {Recurrence with affine level mappings is P-time decidable for CLP(R)},
author = {Fred Mesnard and Alexander Serebrenik},
journal= {arXiv preprint arXiv:cs/0701082},
year = {2007}
}
Comments
To appear in Theory and Practice of Logic Programming (TPLP)