{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T14:54:37Z","timestamp":1791125677436,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642335570","type":"print"},{"value":"9783642335587","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_34","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:32:47Z","timestamp":1349231567000},"page":"455-463","source":"Crossref","is-referenced-by-count":11,"title":["A New Encoding from MinSAT into MaxSAT"],"prefix":"10.1007","author":[{"given":"Zhu","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chu-Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Josep","family":"Argelich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.3233\/SAT190047","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. Journal on Satisfiability, Boolean Modeling and Computation\u00a04, 251\u2013278 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-21581-0_29","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"J. Argelich","year":"2011","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F., Planes, J.: Analyzing the Instances of the MaxSAT Evaluation. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol.\u00a06695, pp. 360\u2013361. Springer, Heidelberg (2011)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Argelich, J., Li, C.M., Many\u00e0, F., Planes, J.: Experimenting with the instances of the MaxSAT Evaluation. In: Proceedings of the 14th International Conference of the Catalan Association for Artificial Intelligence, CCIA 2011, Lleida, Catalonia, Spain, pp. 31\u201340 (2011)","DOI":"10.1007\/978-3-642-21581-0_29"},{"issue":"8-9","key":"34_CR4","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"},{"issue":"1-3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E. Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Applied Mathematics\u00a0123(1-3), 155\u2013225 (2002)","journal-title":"Discrete Applied Mathematics"},{"issue":"7-8","key":"34_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","volume":"174","author":"M.C. Cooper","year":"2010","unstructured":"Cooper, M.C., de Givry, S., Sanchez, M., Schiex, T., Zytnicki, M., Werner, T.: Soft arc consistency revisited. Artif. Intell.\u00a0174(7-8), 449\u2013478 (2010)","journal-title":"Artif. Intell."},{"key":"34_CR7","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"K\u00fcgel, A.: Natural Max-SAT encoding of Min-SAT. In: Proceedings of the Learning and Intelligent Optimization Conference, LION 6, Paris, France (2012)","DOI":"10.1007\/978-3-642-34413-8_40"},{"issue":"2-3","key":"34_CR9","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":"34_CR10","unstructured":"Li, C.M., Many\u00e0, F.: MaxSAT, hard and soft constraints. In: Biere, A., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, pp. 613\u2013631. IOS Press (2009)"},{"issue":"4","key":"34_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":"34_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":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-14186-7_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"C.M. Li","year":"2010","unstructured":"Li, C.M., Many\u00e0, F., Quan, Z., Zhu, Z.: Exact MinSAT Solving. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 363\u2013368. Springer, Heidelberg (2010)"},{"key":"34_CR14","unstructured":"Li, C.M., Zhu, Z., Many\u00e0, F., Simon, L.: Minimum satisfiability and its applications. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, Barcelona, Spain, pp. 605\u2013610 (2011)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Li, C.M., Zhu, Z., Many\u00e0, F., Simon, L.: Optimizing with minimum satisfiability. Artificial Intelligence (2012), http:\/\/dx.doi.org\/10.1016\/j.artint.2012.05.004","DOI":"10.1016\/j.artint.2012.05.004"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T11:54:08Z","timestamp":1594727648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}