{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:57:30Z","timestamp":1776333450289,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642215803","type":"print"},{"value":"9783642215810","type":"electronic"}],"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-21581-0_23","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T13:30:19Z","timestamp":1307712619000},"page":"287-301","source":"Crossref","is-referenced-by-count":21,"title":["Generating Diverse Solutions in SAT"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Nadel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Frontiers in Artificial Intelligence and Applications","volume-title":"Handbook of Satisfiability","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press, Amsterdam (2009)"},{"key":"23_CR2","unstructured":"Agbaria, S., Carmi, D., Cohen, O., Korchemny, D., Lifshits, M., Nadel, A.: SAT-based semiformal verification of hardware. In: Bloem, R., Sharygina, N. (eds.) Proceedings of the 10th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2010), pp. 25\u201332 (October 2010)"},{"key":"23_CR3","unstructured":"Hebrard, E., Hnich, B., O\u2019Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: Veloso, M.M., Kambhampati, S. (eds.) AAAI, pp. 372\u2013377. AAAI Press \/ The MIT Press (2005)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-642-15396-9_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"Y. Schreiber","year":"2010","unstructured":"Schreiber, Y.: Value-ordering heuristics: Search performance vs. Solution diversity. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 429\u2013444. Springer, Heidelberg (2010)"},{"key":"23_CR5","unstructured":"Dechter, R., Kask, K., Bin, E., Emek, R.: Generating random solutions for constraint satisfaction problems. In: AAAI\/IAAI, pp. 15\u201321 (2002)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Kitchen, N., Kuehlmann, A.: Stimulus generation for constrained random simulation. In: ICCAD, pp. 258\u2013265 (2007)","DOI":"10.1109\/ICCAD.2007.4397275"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Near-uniform sampling of combinatorial spaces using XOR constraints. In: Sch\u00f6lkopf, B., Platt, J.C., Hoffman, T. (eds.) NIPS, pp. 481\u2013488 (2006)","DOI":"10.7551\/mitpress\/7503.003.0065"},{"key":"23_CR8","first-page":"530","volume-title":"DAC","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC, pp. 530\u2013535. ACM, New York (2001)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P.M. Silva","year":"1999","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers\u00a048, 506\u2013521 (1999)","journal-title":"IEEE Transactions on Computers"},{"key":"23_CR10","unstructured":"Huang, J.: The effect of restarts on the efficiency of clause learning. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 2318\u20132323 (2007)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11499107_4","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Dershowitz","year":"2005","unstructured":"Dershowitz, N., Hanna, Z., Nadel, A.: A clause-based heuristic for SAT solvers. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 46\u201360. Springer, Heidelberg (2005)"},{"key":"23_CR12","unstructured":"Frost, D., Dechter, R.: In search of the best constraint satisfaction search. In: AAAI, pp. 301\u2013306 (1994)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/10722167_36","volume-title":"Computer Aided Verification","author":"O. Strichman","year":"2000","unstructured":"Strichman, O.: Tuning SAT checkers for bounded model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 480\u2013494. Springer, Heidelberg (2000)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-72788-0_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"K. Pipatsrisawat","year":"2007","unstructured":"Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 294\u2013299. Springer, Heidelberg (2007)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Nadel, A.: Generating diverse solutions in SAT: Paper addendum (2011), http:\/\/www.cs.tau.ac.il\/research\/alexander.nadel\/multiple_cex_addendum.pdf","DOI":"10.1007\/978-3-642-21581-0_23"},{"key":"23_CR16","unstructured":"Heule, M., van Maaren, H.: Look-ahead based SAT solvers [1], pp. 155\u2013184"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21581-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T12:49:29Z","timestamp":1712494169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21581-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215803","9783642215810"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21581-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}