activity
20002008
most citedRecurrence with affine level mappings is P-time decidable for CLP(R)

4 citations · 5 across the 4 of their papers we have counts for

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2008

Automated Termination Proofs for Logic Programs by Term Rewriting

P. Schneider-Kamp, J. Giesl, A. Serebrenik +1

There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the…