Abstract
A Pseudo-Boolean constraint (PB-constraint) is a generalization of a clause. A PB-constraint is an inequality (equality) on a linear combination of Boolean literals \(\left(\sum_{i=1}^n a_il_i\ OP\ b\right)\) where a 1, ⋯ a n and b are constant integers, l 1, ⋯ ,l n are literals and OP is a comparison operator. The left-hand side of a PB-constraint under assignment \(\mathcal{A}\) is equal to the sum of the coefficients whose corresponding literals are mapped to true by \(\mathcal{A}\). This kind of constraints has been widely used in expressing NP-complete problems. Several approaches have been proposed to translate a PB-constraint to CNF, [3], [2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aavani, A.: Translating Pseudo-Boolean Constraints into CNF, http://arxiv.org/abs/1104.1479
Bailleux, O., Boufkhad, Y., Roussel, O.: New encodings of pseudo-boolean constraints into CNF. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 181–194. Springer, Heidelberg (2009)
Eén, N., Sörensson, N.: Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2(3-4), 1–25 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aavani, A. (2011). Translating Pseudo-Boolean Constraints into CNF. In: Sakallah, K.A., Simon, L. (eds) Theory and Applications of Satisfiability Testing - SAT 2011. SAT 2011. Lecture Notes in Computer Science, vol 6695. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21581-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-21581-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21580-3
Online ISBN: 978-3-642-21581-0
eBook Packages: Computer ScienceComputer Science (R0)