{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:23:04Z","timestamp":1725909784381},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319569932"},{"type":"electronic","value":"9783319569949"}],"license":[{"start":{"date-parts":[[2017,8,20]],"date-time":"2017-08-20T00:00:00Z","timestamp":1503187200000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-56994-9_31","type":"book-chapter","created":{"date-parts":[[2017,8,19]],"date-time":"2017-08-19T02:08:25Z","timestamp":1503108505000},"page":"428-452","source":"Crossref","is-referenced-by-count":2,"title":["Solving MaxSAT by Successive Calls to a SAT Solver"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"El Halaby","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,20]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (weighted) partial maxsat through satisfiability testing. In: Theory and Applications of Satisfiability Testing-SAT 2009, pp. 427\u2013440 (2009)","DOI":"10.1007\/978-3-642-02777-2_39"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Gab\u00e0s, J., Levy, J.: Improving sat-based weighted maxSAT solvers. In: Principles and Practice of Constraint Programming, pp. 86\u2013101. Springer (2012)","DOI":"10.1007\/978-3-642-33558-7_9"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Gab\u00e0s, J., Levy, J.: Improving WPM2 for (weighted) partial maxSAT. In: Principles and Practice of Constraint Programming, pp. 117\u2013132. Springer (2013)","DOI":"10.1007\/978-3-642-40627-0_12"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: A New Algorithm for Weighted Partial maxSAT (2010)","DOI":"10.1609\/aaai.v24i1.7545"},{"key":"31_CR5","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: SAT-based maxSAT algorithms. Artif. Intell. 196, 77\u2013105 (2013)"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Malitsky, Y., Sellmann, M.: MaxSAT by Improved Instance-Specific Algorithm Configuration (2014)","DOI":"10.1007\/978-3-319-11230-5"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Davies, J., Bacchus, F.: Postponing optimization to speed up maxSAT solving. In: Principles and Practice of Constraint Programming, pp. 247\u2013262. Springer (2013)","DOI":"10.1007\/978-3-642-40627-0_21"},{"issue":"1\u20134","key":"31_CR8","first-page":"1","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. JSAT 2(1\u20134), 1\u201326 (2006)","journal-title":"JSAT"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Theory and Applications of Satisfiability Testing-SAT 2006, pp. 252\u2013265 (2006)","DOI":"10.1007\/11814948_25"},{"key":"31_CR10","unstructured":"Gent, I.P.: Arc consistency in sat. In: ECAI, vol. 2, pp. 121\u2013125 (2002)"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Heras, F., Morgado, A., Marques-Silva, J.: Core-guided binary search algorithms for maximum satisfiability. In: Proceedings of the AAAI National Conference (AAAI) (2011)","DOI":"10.1609\/aaai.v25i1.7822"},{"key":"31_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.3233\/SAT190091","volume":"8","author":"M Koshimura","year":"2012","unstructured":"Koshimura, M., Zhang, T., Fujita, H., Hasegawa, R.: QMaxSAT: a partial Max-SAT solver system description. J. Satisfiability Boolean Model. Comput. 8, 95\u2013100 (2012)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"31_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D Berre Le","year":"2010","unstructured":"Le Berre, D., Parrain, A.: The SAT4J library, release 2.2 system description. J. Satisfiability Boolean Model. Comput. 7, 59\u201364 (2010)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Li, C.M., Many\u00e0, F., Mohamedou, N., Planes, J.: Exploiting cycle structures in Max-SAT. In: Theory and Applications of Satisfiability Testing-SAT 2009, pp. 467\u2013480 (2009)","DOI":"10.1007\/978-3-642-02777-2_43"},{"key":"31_CR15","unstructured":"Marques-Silva, J.: The MSUNCORE MaxSAT solver. In: SAT 2009 Competitive Events Booklet: Preliminary Version, p. 151 (2009)"},{"key":"31_CR16","unstructured":"Marques-Silva, J., Planes, J.: On Using Unsatisfiability for Solving Maximum Satisfiability. arXiv preprint arXiv:0712.1097 (2007)"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiability using unsatisfiable cores. In: Proceedings of the Conference on Design, Automation and Test in Europe, pp. 408\u2013413. ACM (2008)","DOI":"10.1145\/1403375.1403474"},{"issue":"4","key":"31_CR18","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/s10601-013-9146-2","volume":"18","author":"A Morgado","year":"2013","unstructured":"Morgado, A., Heras, F., Liffiton, M., Planes, J., Marques-Silva, J.: Iterative and core-guided MaxSAT solving: a survey and assessment. Constraints 18(4), 478\u2013534 (2013)","journal-title":"Constraints"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Prestwich, S.: Variable dependency in local search: Prevention is better than cure. In: Theory and Applications of Satisfiability Testing-SAT 2007, pp. 107\u2013120. Springer (2007)","DOI":"10.1007\/978-3-540-72788-0_14"},{"key":"31_CR21","unstructured":"Prestwich, S.D.: CNF encodings. In: Handbook of Satisfiability, vol. 185, pp. 75\u201397 (2009)"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinalityconstraints. In: Principles and Practice of Constraint Programming-CP 2005, pp. 827\u2013831 (2005)","DOI":"10.1007\/11564751_73"}],"container-title":["Lecture Notes in Networks and Systems","Proceedings of SAI Intelligent Systems Conference (IntelliSys) 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56994-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T04:31:37Z","timestamp":1692937897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56994-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,20]]},"ISBN":["9783319569932","9783319569949"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56994-9_31","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2017,8,20]]}}}