{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:16:33Z","timestamp":1771262193950,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237850","type":"print"},{"value":"9783642237867","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-23786-7_19","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"225-239","source":"Crossref","is-referenced-by-count":63,"title":["Solving MAXSAT by Solving a Sequence of Simpler SAT Instances"],"prefix":"10.1007","author":[{"given":"Jessica","family":"Davies","sequence":"first","affiliation":[]},{"given":"Fahiem","family":"Bacchus","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (weighted) partial maxsat through satisfiability testing. In: Proceedings of Theory and Applications of Satisfiability Testing (SAT), pp. 427\u2013440 (2009)","DOI":"10.1007\/978-3-642-02777-2_39"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: A new algorithm for weighted partial maxsat. In: Proceedings of the AAAI National Conference (AAAI), pp. 3\u20138 (2010)","DOI":"10.1609\/aaai.v24i1.7545"},{"issue":"2-4","key":"19_CR3","first-page":"251","volume":"4","author":"J. Argelich","year":"2008","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F., Planes, J.: The First and Second Max-SAT Evaluations. JSAT\u00a04(2-4), 251\u2013278 (2008)","journal-title":"JSAT"},{"issue":"2-3","key":"19_CR4","first-page":"56","volume":"7","author":"D.L. Berre","year":"2010","unstructured":"Berre, D.L., Parrain, A.: The sat4j library, release 2.2. JSAT\u00a07(2-3), 56\u201359 (2010)","journal-title":"JSAT"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-15396-9_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"J. Davies","year":"2010","unstructured":"Davies, J., Cho, J., Bacchus, F.: Using learnt clauses in maxsat. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 176\u2013190. Springer, Heidelberg (2010)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Theory and Applications of Satisfiability Testing (SAT), pp. 252\u2013265 (2006)","DOI":"10.1007\/11814948_25"},{"key":"19_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. Journal of Artificial Intelligence Research (JAIR)\u00a031, 1\u201332 (2008)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-540-85958-1_32","volume-title":"Principles and Practice of Constraint Programming","author":"M. Kitching","year":"2008","unstructured":"Kitching, M., Bacchus, F.: Exploiting decomposition in constraint optimization problems. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 478\u2013492. Springer, Heidelberg (2008)"},{"key":"19_CR9","first-page":"187","volume-title":"Proceedings of the 1999 Oxford-Microsoft Symposium in Honour of Sir Tony Hoare","author":"D.E. Knuth","year":"2000","unstructured":"Knuth, D.E.: Dancing links. In: Proceedings of the 1999 Oxford-Microsoft Symposium in Honour of Sir Tony Hoare, pp. 187\u2013214. Palgrave, Oxford (2000)"},{"key":"19_CR10","unstructured":"Koshimura, M., Zhang, T.: Qmaxsat, http:\/\/sites.google.com\/site\/qmaxsat"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s10601-010-9097-9","volume":"15","author":"C.M. Li","year":"2010","unstructured":"Li, C.M., Many\u00e0, F., Mohamedou, N.O., Planes, J.: Resolution-based lower bounds in maxsat. Constraints\u00a015(4), 456\u2013484 (2010)","journal-title":"Constraints"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Manquinho, V., Marques-Silva, J., Planes, J.: Algorithms for weighted boolean optimization. In: Proceedings of Theory and Applications of Satisfiability Testing (SAT), pp. 495\u2013508 (2009)","DOI":"10.1007\/978-3-642-02777-2_45"},{"key":"19_CR13","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"19_CR14","unstructured":"Weihe, K.: Covering trains by stations or the power of data reduction. In: Proceedings of Algorithms and Experiments (ALEX 1998), pp. 1\u20138 (1998)"},{"key":"19_CR15","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, Chichester (1998)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T02:31:56Z","timestamp":1686277916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}