Pueblo: A Modern Pseudo-Boolean SAT Solver

Authors:
Hossein M. Sheini;Karem A. Sakallah
Affiliations:
University of Michigan, Ann Arbor;University of Michigan, Ann Arbor
Venue:
Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Year:
2005

Citing 4
Cited 12

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Generic ILP versus specialized 0-1 ILP: an update

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
A fast pseudo-boolean constraint solver

Proceedings of the 40th annual Design Automation Conference

Using SAT-based techniques in power estimation

Microelectronics Journal
Efficient symbolic multi-objective design space exploration

Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Symbolic reliability analysis and optimization of ECU networks

Proceedings of the conference on Design, automation and test in Europe
A fast approximation algorithm for MIN-ONE SAT

Proceedings of the conference on Design, automation and test in Europe
A new Approach for Solving Satisfiability Problems with Qualitative Preferences

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
New Encodings of Pseudo-Boolean Constraints into CNF

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Generic preferences over subsets of structured objects

Journal of Artificial Intelligence Research
PN code acquisition using Boolean satisfiability techniques

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Solving multi-objective pseudo-boolean problems

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Solving satisfiability problems with preferences

Constraints
Improving unsatisfiability-based algorithms for boolean optimization

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Planning as satisfiability with IPC simple preferences and action costs

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new SAT solver that integrates logic-based reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an efficient PB literal watching strategy and several PB learning methods that take advantage of the pruning power of PB constraints while minimizing their overhead.