3 citations · 4 across the 3 of their papers we have counts for
3 papers
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…
cs.PL2004
Worst-Case Groundness Analysis Using Definite Boolean Functions
Samir Genaim, Michael Codish, Jacob M. Howe
This note illustrates theoretical worst-case scenarios for groundness analyses obtained through abstract interpretation over the abstract domains of definite (Def) and positive (Po…
cs.PL2003★ 1 cited
Inferring Termination Conditions for Logic Programs using Backwards Analysis
Samir Genaim, Michael Codish
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional termination analysis where an analyser tries to veri…