Pseudo-Boolean Solving by incremental translation to SAT

Authors:
Panagiotis Manolios;Vasilis Papavasileiou
Affiliations:
Northeastern University;Northeastern University
Venue:
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Year:
2011

Citing 10
Cited 1

A fast pseudo-boolean constraint solver

Proceedings of the 40th annual Design Automation Conference
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Automating component-based system assembly

Proceedings of the 2007 international symposium on Software testing and analysis
New Encodings of Pseudo-Boolean Constraints into CNF

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Algorithms for Weighted Boolean Optimization

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A decision procedure for bit-vectors and arrays

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Towards robust CNF encodings of cardinality constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
BDDs for pseudo-boolean constraints: revisited

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Synthesizing cyber-physical architectural models with real-time constraints

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Satisfiability modulo the theory of costs: foundations and applications

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Conflict directed lazy decomposition

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We revisit pseudo-Boolean Solving via compilation to SAT. We provide an algorithm for solving pseudo-Boolean problems through an incremental translation to SAT that works with any incremental SAT solver as a backend. Experimental evaluation shows that our incremental algorithm solves industrial problems that previous SAT-based approaches do not. We also show that SAT-based algorithms for solving pseudo-Boolean problems should be a part of any portfolio solver.