{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:17:31Z","timestamp":1725585451980},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215803"},{"type":"electronic","value":"9783642215810"}],"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_22","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T09:30:19Z","timestamp":1307698219000},"page":"273-286","source":"Crossref","is-referenced-by-count":6,"title":["Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One"],"prefix":"10.1007","author":[{"given":"Ignasi","family":"Ab\u00edo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morgan","family":"Deters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Nieuwenhuis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (weighted) partial maxsat through satisfiability testing. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 427\u2013440. Springer, Heidelberg (2007)","key":"22_CR1","DOI":"10.1007\/978-3-642-02777-2_39"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10817-006-9063-9","volume":"37","author":"O. Bailleux","year":"2006","unstructured":"Bailleux, O., Marquis, P.: Some computational aspects of distance-sat. J. Autom. Reasoning\u00a037(4), 231\u2013260 (2006)","journal-title":"J. Autom. Reasoning"},{"issue":"7","key":"22_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. Comm. of the ACM, CACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Comm. of the ACM, CACM"},{"key":"22_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":"22_CR5","first-page":"142","volume-title":"2002 Conference on Design, Automation, and Test in Europe, DATE 2002","author":"E. Goldberg","year":"2002","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: A Fast and Robust SAT-Solver. In: 2002 Conference on Design, Automation, and Test in Europe, DATE 2002, pp. 142\u2013149. IEEE Computer Society, Los Alamitos (2002)"},{"unstructured":"Hebrard, E., Hnich, B., O\u2019Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: 20th National Conf. on Artificial Intelligence (AAAI), pp. 372\u2013377 (2005)","key":"22_CR6"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2347","volume":"31","author":"F. Heras","year":"2008","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSAT: An efficient Weighted Max-SAT Solver. J. Artificial Intell. Research\u00a031, 1\u201332 (2008)","journal-title":"J. Artificial Intell. Research"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-642-02777-2_42","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"J. Larrosa","year":"2009","unstructured":"Larrosa, J., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: Branch and bound for boolean optimization and the generation of optimality certificates. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 453\u2013466. Springer, Heidelberg (2009)"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10817-010-9176-z","volume":"46","author":"J. Larrosa","year":"2011","unstructured":"Larrosa, J., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: A framework for certified boolean branch-and-bound optimization. J. Autom. Reasoning\u00a046(1), 81\u2013102 (2011)","journal-title":"J. Autom. Reasoning"},{"issue":"3-4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/B:AMAI.0000012872.46214.11","volume":"40","author":"V. Manquinho","year":"2004","unstructured":"Manquinho, V., Marques-Silva, J.: Satisfiability-based algorithms for boolean optimization. Ann. Math. Artif. Intell.\u00a040(3-4), 353\u2013372 (2004)","journal-title":"Ann. Math. Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Manquinho, V., Silva, J.M., Planes, J.: Algorithms for weighted boolean optimization. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 495\u2013508. Springer, Heidelberg (2007)","key":"22_CR11","DOI":"10.1007\/978-3-642-02777-2_45"},{"issue":"6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis\u2013Putnam\u2013Logemann\u2013Loveland procedure to DPLL(T). Journal of the ACM, JACM\u00a053(6), 937\u2013977 (2006)","journal-title":"Journal of the ACM, JACM"},{"issue":"3","key":"22_CR13","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.J., Codish, M.: Propagation via lazy clause generation. Constraints\u00a014(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10817-009-9156-3","volume":"44","author":"K. Pipatsrisawat","year":"2010","unstructured":"Pipatsrisawat, K., Darwiche, A.: On modern clause-learning satisfiability solvers. J. Autom. Reason.\u00a044(3), 277\u2013301 (2010)","journal-title":"J. Autom. Reason."}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T12:21:06Z","timestamp":1560255666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21581-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215803","9783642215810"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21581-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}