{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:25:39Z","timestamp":1725513939250},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_16","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T12:25:22Z","timestamp":1183033522000},"page":"134-147","source":"Crossref","is-referenced-by-count":0,"title":["From Idempotent Generalized Boolean Assignments to Multi-bit Search"],"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":"16_CR1","unstructured":"Anbulagan, A., et al.: Old Resolution Meets Modern SLS. In: AAAI-05, pp. 354\u2013359 (2005)"},{"key":"16_CR2","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 2003 Competition. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 452\u2013467. Springer, Heidelberg (2004)"},{"issue":"7","key":"16_CR3","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/S0167-8191(03)00068-1","volume":"29","author":"W. Blochinger","year":"2003","unstructured":"Blochinger, W., Sinz, C., Kuchlin, W.: Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Computing\u00a029(7), 969\u2013994 (2003)","journal-title":"Parallel Computing"},{"issue":"3-4","key":"16_CR4","first-page":"381","volume":"17","author":"M. Boehm","year":"2006","unstructured":"Boehm, M., Speckenmeyer, E.: A fast parallel SAT-solver - efficient workload balancing. Ann. Math. Artif. Intell.\u00a017(3-4), 381\u2013400 (2006)","journal-title":"Ann. Math. Artif. Intell."},{"key":"16_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2078-5","volume-title":"Boolean Reasoning: The Logic of Boolean Equations","author":"F.M. Brown","year":"1990","unstructured":"Brown, F.M.: Boolean Reasoning: The Logic of Boolean Equations. Kluwer Academic Publishers, Dordrecht (1990)"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10472-005-0421-9","volume":"43","author":"E.A. Hirsch","year":"2005","unstructured":"Hirsch, E.A., Kojevnikov, A.: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. Ann. Math. Artif. Intell.\u00a043(1), 91\u2013111 (2005)","journal-title":"Ann. Math. Artif. Intell."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Krohm, F., Kuehlmann, A., Mets, A.: The Use of Random Simulation in Formal Verification. In: Proc. of Int\u2019l Conf. on Computer Design, pp. 371\u2013376 (1996)","DOI":"10.1109\/ICCD.1996.563581"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: the Second DIMACS Implementation Challenge, pp. 521\u2013532 (1996)","DOI":"10.1090\/dimacs\/026\/25"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/jsco.1996.0030","volume":"21","author":"H. Zhang","year":"1996","unstructured":"Zhang, H., Bonacina, M.P., Hsiang, J.: PSATO: A distributed propositional prover and its application to quasigroup problems. Journal of Symbolic Computation\u00a021, 543\u2013560 (1996)","journal-title":"Journal of Symbolic Computation"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T13:32:53Z","timestamp":1550410373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72788-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540727873","9783540727880"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72788-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}