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
No takes yet. Share an insight, caveat, or question.
Eén et al. (2006) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: