{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:09Z","timestamp":1725603429877},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_47","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T03:58:42Z","timestamp":1314763122000},"page":"621-636","source":"Crossref","is-referenced-by-count":6,"title":["Boolean Equi-propagation for Optimized SAT Encoding"],"prefix":"10.1007","author":[{"given":"Amit","family":"Metodi","sequence":"first","affiliation":[]},{"given":"Michael","family":"Codish","sequence":"additional","affiliation":[]},{"given":"Vitaly","family":"Lagoon","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 108\u2013122. Springer, Heidelberg (2003)"},{"key":"47_CR2","unstructured":"Barrett, C., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library, SMT-LIB (2010), \n                    \n                      www.SMT-LIB.org"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-14186-7_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"M. Bofill","year":"2010","unstructured":"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.\u00a06175, pp. 300\u2013305. Springer, Heidelberg (2010)"},{"issue":"8","key":"47_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"issue":"1-2","key":"47_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.artint.2004.01.006","volume":"162","author":"M. Cadoli","year":"2005","unstructured":"Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. Artificial Intelligence\u00a0162(1-2), 89\u2013120 (2005)","journal-title":"Artificial Intelligence"},{"key":"47_CR6","unstructured":"Crawford, J., Baker, A.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Procs. AAAI 1994, pp. 1092\u20131097 (1994)"},{"key":"47_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible sat-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"47_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T. Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 352\u2013366. Springer, Heidelberg (2009)"},{"issue":"23","key":"47_CR10","doi-asserted-by":"publisher","first-page":"4748","DOI":"10.1093\/nar\/25.23.4748","volume":"25","author":"A.G. Frutos","year":"1997","unstructured":"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\u00a025(23), 4748\u20134757 (1997)","journal-title":"Journal of Nucleic Acids Research"},{"key":"47_CR11","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"98","volume-title":"ECAI","author":"I.P. Gent","year":"2006","unstructured":"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.\u00a0141, pp. 98\u2013102. IOS Press, Amsterdam (2006)"},{"key":"47_CR12","unstructured":"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)"},{"key":"47_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-85958-1_10","volume-title":"Principles and Practice of Constraint Programming","author":"J. Huang","year":"2008","unstructured":"Huang, J.: Universal Booleanization of constraint models. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 144\u2013158. Springer, Heidelberg (2008)"},{"issue":"2","key":"47_CR14","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0166-218X(02)00407-9","volume":"130","author":"C.M. Li","year":"2003","unstructured":"Li, C.M.: Equivalent Literal Propagation in the DLL Procedure. Discrete Applied Mathematics\u00a0130(2), 251\u2013276 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"47_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N. Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: Minizinc: Towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"issue":"3","key":"47_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O. Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P., Codish, M.: Propagation via lazy clause generation. Constraints\u00a014(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"47_CR17","unstructured":"Pomeranz, D., Raziel, B., Rabani, R., Berend, D., Goldberg, M.: BGU Nonogram solver (student project), \n                    \n                      http:\/\/www.cs.bgu.ac.il\/~benr\/nonograms\n                    \n                    \n                   (viewed March 2011)"},{"key":"47_CR18","unstructured":"Regin, J.-C.: A filtering algorithm for constraints of difference in CSP. In: Procs. AAAI 1994, pp. 362\u2013367 (1994)"},{"key":"47_CR19","unstructured":"Somenzi, F.: CUDD: Colorado University Decision Diagram package (February 2009), \n                    \n                      http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/\n                    \n                    \n                   (Online, accessed April 13, 2011)"},{"issue":"2","key":"47_CR20","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N. Tamura","year":"2009","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints\u00a014(2), 254\u2013272 (2009)","journal-title":"Constraints"},{"issue":"2","key":"47_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. Tarjan","year":"1975","unstructured":"Tarjan, R.: Efficiency of a good but not linear set union algorithm. JACM\u00a022(2), 215\u2013225 (1975)","journal-title":"JACM"},{"key":"47_CR22","unstructured":"Wolter, J.: Nonogram puzzle collection, \n                    \n                      http:\/\/webpbn.com\/export.cgi\n                    \n                    \n                   (viewed March 2011)"},{"key":"47_CR23","unstructured":"Wolter, J.: Nonogram random puzzle collection, \n                    \n                      http:\/\/webpbn.com\/survey\/rand30.tgz\n                    \n                    \n                   (viewed March 2011)"},{"key":"47_CR24","unstructured":"Wolter, J.: Wolter Nonogram solver, \n                    \n                      http:\/\/webpbn.com\/pbnsolve.html\n                    \n                    \n                   (viewed March 2011)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T12:42:02Z","timestamp":1554122522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}