Abstract
We present an approach to propagation based SAT encoding, Boolean equi-propagation, where constraints are modelled as Boolean functions which propagate information about equalities between Boolean literals. This information is then applied as a form of partial evaluation to simplify constraints prior to their encoding as CNF formulae. We demonstrate for a variety of benchmarks that our approach leads to a considerable reduction in the size of CNF encodings and subsequent speed-ups in SAT solving times.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108–122. Springer, Heidelberg (2003)
Barrett, C., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library, SMT-LIB (2010), www.SMT-LIB.org
Bofill, M., Suy, J., Villaret, M.: A System for solving constraint satisfaction problems with SMT. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 300–305. Springer, Heidelberg (2010)
Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)
Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artificial Intelligence 162(1-2), 89–120 (2005)
Crawford, J., Baker, A.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Procs. AAAI 1994, pp. 1092–1097 (1994)
Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61–75. Springer, Heidelberg (2005)
Eén, N., Sörensson, N.: An extensible sat-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Feydy, T., Stuckey, P.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352–366. Springer, Heidelberg (2009)
Frutos, A.G., Qinghua Liu, A.J.T., Sanner, A.M.W., Condon, A.E., Smith, L.M., Corn, R.M.: Demonstration of a word design strategy for DNA computing on surfaces. Journal of Nucleic Acids Research 25(23), 4748–4757 (1997)
Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol. 141, pp. 98–102. IOS Press, Amsterdam (2006)
Gomes, C., Shmoys, D.: Completing Quasigroups or Latin Squares: A structured graph coloring problem. In: Proceedings of the Computational Symposium on Graph Coloring and Extensions (2002)
Huang, J.: Universal Booleanization of constraint models. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 144–158. Springer, Heidelberg (2008)
Li, C.M.: Equivalent Literal Propagation in the DLL Procedure. Discrete Applied Mathematics 130(2), 251–276 (2003)
Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: Minizinc: Towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)
Ohrimenko, O., Stuckey, P., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357–391 (2009)
Pomeranz, D., Raziel, B., Rabani, R., Berend, D., Goldberg, M.: BGU Nonogram solver (student project), http://www.cs.bgu.ac.il/~benr/nonograms (viewed March 2011)
Regin, J.-C.: A filtering algorithm for constraints of difference in CSP. In: Procs. AAAI 1994, pp. 362–367 (1994)
Somenzi, F.: CUDD: Colorado University Decision Diagram package (February 2009), http://vlsi.colorado.edu/~fabio/CUDD/ (Online, accessed April 13, 2011)
Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints 14(2), 254–272 (2009)
Tarjan, R.: Efficiency of a good but not linear set union algorithm. JACM 22(2), 215–225 (1975)
Wolter, J.: Nonogram puzzle collection, http://webpbn.com/export.cgi (viewed March 2011)
Wolter, J.: Nonogram random puzzle collection, http://webpbn.com/survey/rand30.tgz (viewed March 2011)
Wolter, J.: Wolter Nonogram solver, http://webpbn.com/pbnsolve.html (viewed March 2011)
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
Metodi, A., Codish, M., Lagoon, V., Stuckey, P.J. (2011). Boolean Equi-propagation for Optimized SAT Encoding. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-23786-7_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23785-0
Online ISBN: 978-3-642-23786-7
eBook Packages: Computer ScienceComputer Science (R0)