21 search results - page 1 / 5 » PB-smodels a Pseudo-Boolean Solver |
JSAT
2006
13 years 7 months ago
2006
The first evaluation of pseudo-Boolean solvers was organized as a subtrack of the SAT 2005 competition. The first goal of this event is to take a snapshot of the current state of ...
JSAT
2006
13 years 7 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 1 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...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
AAAI
2006
13 years 9 months ago
2006
