3 search results - page 1 / 1 » Pueblo: A Hybrid Pseudo-Boolean SAT Solver |
JSAT
2006
13 years 10 months ago
2006
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
DATE
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper introduces a new SAT solver that integrates logicbased reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an eff...
CSCLP
2004
Springer
14 years 3 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...