Showing cs.LOShow all
2 papers · 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…
cs.LO2006★ 3 cited
SAT Solving for Argument Filterings
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon +2
This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for termination an…