Pueblo: A Hybrid Pseudo-Boolean SAT Solver

@article{Sheini2006PuebloAH,
  title={Pueblo: A Hybrid Pseudo-Boolean SAT Solver},
  author={Hossein M. Sheini and Karem A. Sakallah},
  journal={J. Satisf. Boolean Model. Comput.},
  year={2006},
  volume={2},
  pages={165-189}
}
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 problems. To achieve this, we adopt the cutting-plane technique to draw inferences among PB constraints and combine it with generic implication graph analysis for conflict-induced learning. Novel features of our approach include a light-weight and efficient hybrid learning and backjumping strategy for analyzing PB… Expand
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning
TLDR
This work lifts core-guided search to pseudo-Boolean (PB) solvers, which deal with more general PB optimization problems and operate natively with cardinality constraints, and derives stronger cardinality constraint constraints, which yield better updates to solution bounds. Expand
New Encoding for Translating Pseudo-Boolean Constraints into SAT
TLDR
A new, two-step, method for transforming PB constraints to propositional CNF formulas, which indicates that this method out-performs other transformations to CNF when the coefficients of the PB constraints are not small. Expand
On Weakening Strategies for PB Solvers
TLDR
New application strategies for this rule are studied, aiming to infer strong constraints with small coefficients, and it is observed that each of them improves the runtime of the solver. Expand
Learning Techniques for Pseudo-Boolean Solving and Optimization
TLDR
This work presents a contribution by providing an exhaustive comparitive study between several learning schemes in a common platform, to build an “instance aware” PB solver that takes advantage of all different learning schemes. Expand
JPseudo : replacing resolution by cutting planes
SAT4J [1] is an open-source library of conflict-driven clause learning SAT solvers in the spirit of GRASP, zChaff and MiniSAT in Java. Its extension to pseudoboolean optimization is done by replacingExpand
Pseudo-Boolean Optimization by Implicit Hitting Sets
Recent developments in applying and extending Boolean satisfiability (SAT) based techniques have resulted in new types of approaches to pseudo-Boolean optimization (PBO), complementary to the moreExpand
On Dedicated CDCL Strategies for PB Solvers
Current implementations of pseudo-Boolean (PB) solvers working on native PB constraints are based on the CDCL architecture which empowers highly efficient modern SAT solvers. In particular, such PBExpand
A Cardinal Improvement to Pseudo-Boolean Solving
TLDR
This work presents a technique to recover cardinality constraints from CNF on the fly during search by collecting potential building blocks of cardinality constraint constraints during propagation and combining these blocks during conflict analysis. Expand
On extending SAT solvers for PB problems
The use of SAT solvers to handle practical problems has grown dramatically over the last decade. SAT solvers are now mature enough to be used in hardware or software model checkers and to have anExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 47 REFERENCES
A fast pseudo-Boolean constraint solver
  • D. Chai, A. Kuehlmann
  • Computer Science, Mathematics
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2005
TLDR
This paper reviews how recent advances in satisfiability search can be extended for pseudo-Boolean constraints and describes a new LPB solver that is based on generalized constraint propagation and conflict-based learning and presents a comparison with other, state-of-the-art LPBsolvers. Expand
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
TLDR
The experimental results indicate that the integration of cutting planes with backtrack search is an extremely effective technique for PBO. Expand
Solving Linear Pseudo-Boolean Constraint Problems with Local Search
TLDR
It is shown that domain-independent local search for satisfiability (Walksat) can be generalized to handle systems of linear pseudo-Boolean (0-1 integer) constraints, a representation that is widely used in operations research. Expand
Translating Pseudo-Boolean Constraints into SAT
TLDR
By applying a proper mix of translation techniques, a SAT-solver can perform on a par with the best existing native pseudo-boolean solvers, particularly valuable in cases where the constraint problem of interest is naturally expressed as a SAT problem, except for a handful of constraints. Expand
Pueblo: a modern pseudo-Boolean SAT solver
TLDR
A new SAT (satisfiability) solver that integrates logic-based reasoning and integer programming methods to systems of CNF and PB constraints and several PB learning methods that take advantage of the pruning power of PB constraints while minimizing their overhead are introduced. Expand
GRASP: A Search Algorithm for Propositional Satisfiability
TLDR
Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. Expand
Effective lower bounding techniques for pseudo-Boolean optimization [EDA applications]
TLDR
It is shown that the utilization of lower bound estimation methods with SAT-related techniques can dramatically improve the overall performance of PBO solvers for most existing benchmarks from EDA. Expand
An Extensible SAT-solver
TLDR
This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints. Expand
Nogood Recording for Static and Dynamic Constraint Satisfaction Problems
TLDR
A new class of constraint recording algorithms called nogood recording that may be used for solving both dynamic C SPs and usual CSP (called static CSPs here) and offers an interesting compromise, polynomially bounded in space, between an ATMS-like (Assumption-based Truth Maintenance System) approach and the usual constraint satisfaction algorithms. Expand
A Simple Model to Generate Hard Satisfiable Instances
TLDR
A formal analysis shows that it is possible to generate forced satisfiable instances whose hardness is similar to unforced satisfiable ones and this analysis is supported by some representative results taken from an intensive experimentation that is carried out, using complete and incomplete search methods. Expand
...
1
2
3
4
5
...