{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:32Z","timestamp":1743049652742,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319104270"},{"type":"electronic","value":"9783319104287"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10428-7_10","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T01:33:54Z","timestamp":1407893634000},"page":"92-107","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Application of Max-SAT Resolution on Inconsistent Subsets"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Abram\u00e9","sequence":"first","affiliation":[]},{"given":"Djamal","family":"Habet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11814948_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"M.L. Bonet","year":"2006","unstructured":"Bonet, M.L., Levy, J., Many\u00e0, F.: A complete calculus for max-sat. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 240\u2013251. Springer, Heidelberg (2006)"},{"issue":"8-9","key":"10_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.artint.2007.03.001","volume":"171","author":"M.L. Bonet","year":"2007","unstructured":"Bonet, M.L., Levy, J., Many\u00e1, F.: Resolution for max-sat. Artificial Intelligence\u00a0171(8-9), 606\u2013618 (2007)","journal-title":"Artificial Intelligence"},{"key":"10_CR3","unstructured":"Heras, F., Larrosa, J.: New inference rules for efficient max-sat solving. In: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI 2006, vol.\u00a01, pp. 68\u201373. AAAI Press (2006)"},{"issue":"2-3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.artint.2007.05.006","volume":"172","author":"J. Larrosa","year":"2008","unstructured":"Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient max-sat solving. Artificial Intelligence\u00a0172(2-3), 204\u2013233 (2008)","journal-title":"Artificial Intelligence"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-642-02777-2_43","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"C.M. Li","year":"2009","unstructured":"Li, C.M., Many\u00e0, F., Mohamedou, N., Planes, J.: Exploiting cycle structures in max-sat. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 467\u2013480. Springer, Heidelberg (2009)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/11564751_31","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C.M. Li","year":"2005","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch and bound max-sat solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 403\u2013414. Springer, Heidelberg (2005)"},{"key":"10_CR7","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for max-sat. In: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI 2006, pp. 86\u201391. AAAI Press (2006)"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.2215","volume":"30","author":"C.M. Li","year":"2007","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: New inference rules for max-sat. Journal of Artificial Intelligence Research\u00a030, 321\u2013359 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s10601-010-9097-9","volume":"15","author":"C. Li","year":"2010","unstructured":"Li, C., Many\u00e1, F., Mohamedou, N., Planes, J.: Resolution-based lower bounds in maxsat. Constraints\u00a015(4), 456\u2013484 (2010)","journal-title":"Constraints"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: Grasp: A search algorithm for propositional satisfiability. IEEE Transactions on Computers\u00a048(5), 506\u2013521 (1999)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10428-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T20:20:55Z","timestamp":1676406055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-10428-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319104270","9783319104287"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10428-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}