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…