4 citations · 5 across the 5 of their papers we have counts for
1 paper · 1 filter
Fred Mesnard, Alexander Serebrenik
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 d…