Translating Pseudo-Boolean Constraints into SAT
Journal article, 2005

In this paper, we describe and evaluate three different techniques for translating pseudo-boolean constraints (linear constraints over boolean variables) into clauses that can be handled by a standard SAT-solver. We show that by applying a proper mix of translation techniques, a SAT-solver can perform on a par with the best existing native pseudo-boolean solvers. This is particularly valuable in those cases where the constraint problem of interest is naturally expressed as a SAT problem, except for a handful of constraints.Translating those constraints to get a pure clausal problem will take full advantage of the latest improvements in SAT research. A particularly interesting result of this work is the efficiency of sorting networks to express pseudo-boolean constraints. Although tangential to this presentation, the result gives a suggestion as to how synthesis tools may be modified to produce arithmetic circuits more suitable for SAT based reasoning.

integer linear programming



SAT translation


Niklas Een

Chalmers, Computer Science and Engineering (Chalmers)

Niklas Sörensson

University of Gothenburg

Journal on Satisfiability, Boolean Modeling and Computation

1574-0617 (ISSN)

Vol. 2 1-26

Subject Categories

Computer Science

More information