{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T04:55:33Z","timestamp":1767156933213},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_43","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T02:58:18Z","timestamp":1245985098000},"page":"467-480","source":"Crossref","is-referenced-by-count":28,"title":["Exploiting Cycle Structures in Max-SAT"],"prefix":"10.1007","author":[{"given":"Chu Min","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nouredine","family":"Mohamedou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Planes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F.: An improved exact solver for partial Max-SAT. In: NCP 2007, pp. 230\u2013231 (2007)"},{"issue":"8-9","key":"43_CR2","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.artint.2007.03.001","volume":"171","author":"M.L. Bonet","year":"2007","unstructured":"Bonet, M.L., Levy, J., Many\u00e0, F.: Resolution for Max-SAT. Artificial Intelligence\u00a0171(8-9), 240\u2013251 (2007)","journal-title":"Artificial Intelligence"},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-74970-7_18","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Darras","year":"2007","unstructured":"Darras, S., Dequen, G., Devendeville, L., Li, C.M.: On inconsistent clause-subsets for max-SAT solving. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 225\u2013240. Springer, Heidelberg (2007)"},{"key":"43_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-72788-0_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"F. Heras","year":"2007","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: A new weighted Max-SAT solver. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 41\u201355. Springer, Heidelberg (2007)"},{"key":"43_CR5","unstructured":"Larrosa, J., Heras, F.: Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In: IJCAI 2005, pp. 193\u2013198 (2005)"},{"issue":"2-3","key":"43_CR6","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":"43_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-540-85958-1_46","volume-title":"Principles and Practice of Constraint Programming","author":"C.M. Li","year":"2008","unstructured":"Li, C.M., Many\u00e0, F., Mohamedou, N.O., Planes, J.: Transforming inconsistent subformulas in MaxSAT lower bound computation. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 582\u2013587. Springer, Heidelberg (2008)"},{"key":"43_CR8","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":"43_CR9","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In: AAAI 2006, pp. 86\u201391 (2006)"},{"key":"43_CR10","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"},{"key":"43_CR11","unstructured":"Lin, H., Su, K., Li, C.M.: Within-problem learning for efficient lower bound computation in Max-SAT solving. In: AAAI 2008, pp. 351\u2013356 (2008)"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Pipatsrisawat, K., Darwiche, A.: Clone: Solving weighted Max-SAT in a reduced search space. In: AI 2007, pp. 223\u2013233 (2007)","DOI":"10.1007\/978-3-540-76928-6_24"},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-74970-7_43","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"M. Ram\u00edrez","year":"2007","unstructured":"Ram\u00edrez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 605\u2013619. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T22:57:42Z","timestamp":1558393062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}