24 citations · 25 across the 3 of their papers we have counts for
4 papers
Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
Amit Metodi, Michael Codish, Peter James Stuckey
We present an approach to propagation-based SAT encoding of combinatorial problems, Boolean equi-propagation, where constraints are modeled as Boolean functions which propagate inf…
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…
Compiling Finite Domain Constraints to SAT with BEE
Amit Metodi, Michael Codish
We present BEE, a compiler which enables to encode finite domain constraint problems to CNF. Using BEE both eases the encoding process for the user and also performs transformation…
Boolean Equi-propagation for Optimized SAT Encoding
Amit Metodi, Michael Codish, Vitaly Lagoon +1
We present an approach to propagation based solving, Boolean equi-propagation, where constraints are modelled as propagators of information about equalities between Boolean literal…