4 citations · 7 across the 3 of their papers we have counts for
3 papers · 1 filter
Loops under Strategies ... Continued
René Thiemann, Christian Sternagel, Jürgen Giesl +1
While there are many approaches for automatically proving termination of term rewrite systems, up to now there exist only few techniques to disprove their termination automatically…
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…
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…