Boolean equi-propagation for optimized SAT encoding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6876 LNCS, Issue , 2011, Pages 621-636

  Metodi, Amit ^a   Codish, Michael ^a   Lagoon, Vitaly ^b   Stuckey, Peter J ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b CADENCE DESIGN SYSTEMS   (United States)

^c UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODINGS; LITERALS; PARTIAL EVALUATION; SAT-SOLVING;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; ENCODING (SYMBOLS);

BOOLEAN FUNCTIONS; SIGNAL ENCODING;

EID: 80053014980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23786-7_47     Document Type: Conference Paper

References (24)

1. 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)
2. Barrett, C., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library, SMT-LIB (2010), www.SMT-LIB.org
3. 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)
4. Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(8), 677-691 (1986)
5. Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artificial Intelligence 162(1-2), 89-120 (2005)
6. Crawford, J., Baker, A.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Procs. AAAI 1994, pp. 1092-1097 (1994)
7. 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)
8. 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)
9. Feydy, T., Stuckey, P.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352-366. Springer, Heidelberg (2009)
10. 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)
11. 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)
12. 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)
13. Huang, J.: Universal Booleanization of constraint models. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 144-158. Springer, Heidelberg (2008)
14. Li, C.M.: Equivalent Literal Propagation in the DLL Procedure. Discrete Applied Mathematics 130(2), 251-276 (2003)
15. 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)
16. Ohrimenko, O., Stuckey, P., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357-391 (2009)
17. 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)
18. Regin, J.-C.: A filtering algorithm for constraints of difference in CSP. In: Procs. AAAI 1994, pp. 362-367 (1994)
19. Somenzi, F.: CUDD: Colorado University Decision Diagram package (February 2009), http://vlsi.colorado.edu/~fabio/CUDD/ (Online, accessed April 13, 2011)
20. Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints 14(2), 254-272 (2009)
21. Tarjan, R.: Efficiency of a good but not linear set union algorithm. JACM 22(2), 215-225 (1975)
22. Wolter, J.: Nonogram puzzle collection, http://webpbn.com/export.cgi (viewed March 2011)
23. Wolter, J.: Nonogram random puzzle collection, http://webpbn.com/survey/ rand30.tgz (viewed March 2011)
24. Wolter, J.: Wolter Nonogram solver, http://webpbn.com/pbnsolve.html (viewed March 2011)