{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:19:26Z","timestamp":1726409966013},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797180"},{"type":"electronic","value":"9783540797197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79719-7_2","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T08:04:57Z","timestamp":1210061097000},"page":"15-20","source":"Crossref","is-referenced-by-count":3,"title":["A Preprocessor for Max-SAT Solvers"],"prefix":"10.1007","author":[{"given":"Josep","family":"Argelich","sequence":"first","affiliation":[]},{"given":"Chu Min","family":"Li","sequence":"additional","affiliation":[]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/11499107_27","volume-title":"Theory and Applications of Satisfiability Testing","author":"Teresa Alsinet","year":"2005","unstructured":"Alsinet, T., Many\u00e0, F., Planes, J.: Improved exact solver for weighted Max-SAT. In: SAT-2005, pp. 371\u2013377 (2005)"},{"issue":"4\u20135","key":"2_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10732-006-7234-9","volume":"12","author":"J. Argelich","year":"2006","unstructured":"Argelich, J., Many\u00e0, F.: Exact Max-SAT solvers for over-constrained problems. Journal of Heuristics\u00a012(4\u20135), 375\u2013392 (2006)","journal-title":"Journal of Heuristics"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Argelich, J., Many\u00e0, F.: Partial Max-SAT solvers with clause learning. In: SAT-2007, pp. 28\u201340 (2007)","DOI":"10.1007\/978-3-540-72788-0_7"},{"key":"2_CR4","first-page":"240","volume-title":"Lecture Notes in Computer Science","author":"Mar\u00eda Luisa Bonet","year":"2006","unstructured":"Bonet, M.L., Levy, J., Many\u00e0, F.: A complete calculus for Max-SAT. In: SAT-2006, pp. 240\u2013251 (2006)"},{"issue":"8\u20139","key":"2_CR5","first-page":"240","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\u20139), 240\u2013251 (2007)","journal-title":"Artificial Intelligence"},{"key":"2_CR6","first-page":"252","volume-title":"Lecture Notes in Computer Science","author":"Zhaohui Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: SAT-2006, pp. 252\u2013265 (2006)"},{"key":"2_CR7","unstructured":"Heras, F., Larrosa, J.: New inference rules for efficient Max-SAT solving. In: AAAI-2006, pp. 68\u201373 (2006)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: A new weighted Max-SAT solver. In: SAT-2007 (2007)","DOI":"10.1613\/jair.2347"},{"key":"2_CR9","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)"},{"key":"2_CR10","first-page":"403","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"Chu Min 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: CP-2005, pp. 403\u2013414 (2005)"},{"key":"2_CR11","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":"2_CR12","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":"2_CR13","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Planes, J.: Algorithms for Maximum Satisfiability using Unsatisfiable Cores. In: DATE-2008 (2008)","DOI":"10.1109\/DATE.2008.4484715"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Pipatsrisawat, K., Darwiche, A.: Clone: Solving weighted max-sat in a reduced search space. In: 20th Australian Joint Conf.\u00a0on AI, AI-2007, pp. 223\u2013233 (2007)","DOI":"10.1007\/978-3-540-76928-6_24"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Ram\u00edrez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In: CP-2007, pp. 605\u2013619 (2007)","DOI":"10.1007\/978-3-540-74970-7_43"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79719-7_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:29:13Z","timestamp":1619522953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79719-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797180","9783540797197"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79719-7_2","relation":{},"subject":[]}}