5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.LO2011★ 1 cited
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram +2
We describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial ext…
cs.PL2007★ 5 cited
Logic Programming with Satisfiability
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic program- ming with satisfiability combines the strengths of the two paradigms: logic programming…