1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.PL2013★ 1 cited
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…
cs.DM2010
Optimal Base Encodings for Pseudo-Boolean Constraints
Michael Codish, Yoav Fekete, Carsten Fuhs +1
This paper formalizes the optimal base problem, presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT. We demonstrat…