Translating Pseudo-Boolean Constraints into SAT

Niklas Eén, Niklas Sörensson · Journal on Satisfiability Boolean Modeling and Computation · 2006

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

Read the paper · More papers on PaperTik