{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:06:33Z","timestamp":1794344793847,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262763","type":"print"},{"value":"9783540316794","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499107_4","type":"book-chapter","created":{"date-parts":[[2007,1,26]],"date-time":"2007-01-26T11:43:44Z","timestamp":1169811824000},"page":"46-60","source":"Crossref","is-referenced-by-count":12,"title":["A Clause-Based Heuristic for SAT Solvers"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziyad","family":"Hanna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Nadel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Alfredsson, J.: The SAT solver Oepir, http:\/\/www.lri.fr\/~simon\/contest\/results\/ONLINEBOOKLET\/OepirA.ps (viewed January 16, 2005)"},{"key":"4_CR2","unstructured":"Bayardo Jr., R., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the National Conference on Artificial Intelligence, pp. 203\u2013208 (1997)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a0(5), 394\u2013397 (1962)","DOI":"10.1145\/368273.368557"},{"key":"4_CR4","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":"4_CR5","doi-asserted-by":"crossref","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. In: Design, Automation, and Test in Europe (DATE 2002), March 2002, pp. 142\u2013149 (2002)","DOI":"10.1109\/DATE.2002.998262"},{"key":"4_CR6","unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings of the National Conference on Artificial Intelligence (July 1998)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Jeroslaw, R.G., Wang, J.: Solving propositional satisfiability problems. Annals of mathematics and Artificial Intelligence\u00a0(1), 167\u2013187 (1990)","DOI":"10.1007\/BF01531077"},{"key":"4_CR8","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Proceedings of the 10th European conference on Artificial intelligence (1992)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11527695_25","volume-title":"Theory and Applications of Satisfiability Testing","author":"D. Berre Le","year":"2005","unstructured":"Le Berre, D., Simon, L.: Fifty-five solvers in Vancouver: The SAT 2004 competition. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 321\u2013344. Springer, Heidelberg (2005)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/11527695_27","volume-title":"Theory and Applications of Satisfiability Testing","author":"Y.S. Mahajan","year":"2005","unstructured":"Mahajan, Y.S., Fu, Z., Malik, S.: ZChaff2004: an efficient SAT solver. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 360\u2013375. Springer, Heidelberg (2005)"},{"key":"4_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-48159-1_5","volume-title":"Progress in Artificial Intelligence","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P.: The impact of branching heuristics in propositional satisfiability algorithms. In: Barahona, P., Alferes, J.J. (eds.) EPIA 1999. LNCS (LNAI), vol.\u00a01695, pp. 62\u201374. Springer, Heidelberg (1999)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers\u00a0(48), 506\u2013521 (1999)","DOI":"10.1109\/12.769433"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the Design Automation Conference (2001)","DOI":"10.1145\/378239.379017"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Prasad, M.R., Biere, A., Gupta, A.: A survey of recent advances in SAT-based formal verification. Intl. Journal on Software Tools for Technology Transfer (STTT)\u00a0(7), 156\u2013173 (2005)","DOI":"10.1007\/s10009-004-0183-4"},{"key":"4_CR15","unstructured":"Ryan, L.: Efficient algorithms for clause-learning SAT solvers. Masters thesis, Simon Fraser University (February 2004)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","year":"2005","unstructured":"Hoos, H.H., Mitchell, D.G. (eds.): SAT 2004. LNCS, vol.\u00a03542. Springer, Heidelberg (2005), http:\/\/satlive.org\/SATCompetition\/2004\/ (viewed September 1, 2004)"},{"key":"4_CR17","unstructured":"Zabih, R., McAllester, D.A.: A rearrangement search strategy for determining propositional satisfiability. In: Proceedings of National Conference on Artificial Intelligence, pp. 155\u2013160 (1988)"},{"key":"4_CR18","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: International Conference on Computer-Aided Design (ICCAD 2001), November 2001, pp. 279\u2013285 (2001)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:41:20Z","timestamp":1619491280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11499107_4","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b137280","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}