Recurrence with affine level mappings is P-time decidable for CLP(R)
<|reference_start|>Recurrence with affine level mappings is P-time decidable for CLP(R): 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.<|reference_end|>
@article{mesnard2007recurrence,
    title={Recurrence with affine level mappings is P-time decidable for CLP(R)},
    author={Fred Mesnard, Alexander Serebrenik},
    journal={arXiv preprint arXiv:cs/0701082},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0701082},
    primaryClass={cs.PL cs.LO}
}