39 citations · 161 across the 21 of their papers we have counts for
4 papers · 1 filter
Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut
Michael Codish, Yoav Fekete, Amit Metodi
BEE is a compiler which facilitates solving finite domain constraints by encoding them to CNF and applying an underlying SAT solver. In BEE constraints are modeled as Boolean funct…
Solving Partial Order Constraints for LPO Termination
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take intege…
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…
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…