{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:25:19Z","timestamp":1725513919286},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727873"},{"type":"electronic","value":"9783540727880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72788-0_25","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T12:25:22Z","timestamp":1183033522000},"page":"258-271","source":"Crossref","is-referenced-by-count":4,"title":["Effective Incorporation of Double Look-Ahead Procedures"],"prefix":"10.1007","author":[{"given":"Marijn","family":"Heule","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"van Maaren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., et al.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) ETAPS 1999 and TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"25_CR2","unstructured":"Connamacher, H.: A random constraint satisfaction problem that seems hard for DPLL. In: Proceedings of SAT (2004)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"25_CR4","unstructured":"Dubois, O., Dequen, G.: source code of the kcnfs solver. Available at \n                  \n                    http:\/\/www.laria.u-picardie.fr\/~dequen\/sat\/"},{"key":"25_CR5","unstructured":"Freeman, J.W.: Improvements to Propositional Satisfiability Search Algorithms. Ph.D. thesis, University of Pennsylvania, Philadelphia (1995)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/978-3-540-24605-3_34","volume-title":"Theory and Applications of Satisfiability Testing","author":"D. Berre Le","year":"2004","unstructured":"Le Berre, D., Simon, L.: The essentials of the SAT\u201903 Competition. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 452\u2013467. Springer, Heidelberg (2004)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(99)00088-5","volume":"71","author":"C.M. Li","year":"1999","unstructured":"Li, C.M.: A constraint-based approach to narrow search trees for satisfiability. Information processing letters\u00a071, 75\u201380 (1999)","journal-title":"Information processing letters"},{"key":"25_CR8","unstructured":"Li, C.M., Anbulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. In: Proc. of Fifteenth IJCAI, pp. 366\u2013371 (1997)"},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10472-005-0431-7","volume":"43","author":"L. Simon","year":"2005","unstructured":"Simon, L., Le Berre, D., Hirsch, E.: The SAT 2002 competition. Annals of Mathematics and Artificial Intelligence (AMAI)\u00a043, 343\u2013378 (2005)","journal-title":"Annals of Mathematics and Artificial Intelligence (AMAI)"},{"key":"25_CR10","unstructured":"Simon, L.: Sat\u201904 competition homepage, \n                  \n                    http:\/\/www.satcompetition.org\/2004"},{"key":"25_CR11","unstructured":"Zhang, H., Stickel, M.E.: Implementing the Davis-Putnam Method. In: SAT 2000, pp. 309\u2013326 (2000)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72788-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T13:34:19Z","timestamp":1550410459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72788-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540727873","9783540727880"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72788-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}