Abstract
This paper formalizes the optimal base problem, presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT. We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MiniSat + . Experimentation indicates that our algorithm scales to bases involving numbers up to 1,000,000, improving on the restriction in MiniSat + to prime numbers up to 17. We show that, while for many examples primes up to 17 do suffice, encoding with respect to optimal bases reduces the CNF sizes and improves the subsequent SAT solving time for many examples.
Supported by GIF grant 966-116.6 and the Danish Natural Science Research Council.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bailleux, O., Boufkhad, Y., Roussel, O.: A translation of pseudo boolean constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 2(1-4), 191–200 (2006)
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)
Barth, P.: Logic-based 0-1 constraint programming. Kluwer Academic Publishers, Norwell (1996)
Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference. AFIPS Conference Proceedings, vol. 32, pp. 307–314. Thomson Book Company, Washington, D.C (1968)
Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: A test set of mixed integer programming problems. SIAM News 25, 16 (1992)
Bryant, R.E., Lahiri, S.K., Seshia, S.A.: Deciding CLU logic formulas via boolean and pseudo-boolean encodings. In: Proc. Intl. Workshop on Constraints in Formal Verification, CFV 2002 (2002)
Chor, B., Lemke, P., Mador, Z.: On the number of ordered factorizations of natural numbers. Discrete Mathematics 214(1-3), 123–133 (2000)
Codish, M., Fekete, Y., Fuhs, C., Schneider-Kamp, P.: Optimal Base Encodings for Pseudo-Boolean Constraints. Technical Report, arXiv:1007.4935 [cs.DM], http://arxiv.org/abs/1007.4935
Eén, N., Sörensson, N.: Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 2(1-4), 1–26 (2006)
Knuth, D.: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading (1973)
Manquinho, V.M., Roussel, O.: The first evaluation of Pseudo-Boolean solvers (PB 2005). Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 2(1-4), 103–143 (2006)
Sidorov, N.: Sum-of-digits function for certain nonstationary bases. Journal of Mathematical Sciences 96(5), 3609–3615 (1999)
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
Codish, M., Fekete, Y., Fuhs, C., Schneider-Kamp, P. (2011). Optimal Base Encodings for Pseudo-Boolean Constraints. In: Abdulla, P.A., Leino, K.R.M. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2011. Lecture Notes in Computer Science, vol 6605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19835-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-19835-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19834-2
Online ISBN: 978-3-642-19835-9
eBook Packages: Computer ScienceComputer Science (R0)