{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:10:09Z","timestamp":1758273009937},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_13","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T03:11:01Z","timestamp":1378523461000},"page":"133-142","source":"Crossref","is-referenced-by-count":5,"title":["MinSAT versus MaxSAT for Optimization Problems"],"prefix":"10.1007","author":[{"given":"Josep","family":"Argelich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chu-Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: A new algorithm for weighted partial MaxSAT. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2008, Atlanta, USA, pp. 3\u20138 (2010)","DOI":"10.1609\/aaai.v24i1.7545"},{"key":"13_CR2","unstructured":"Ans\u00f3tegui, C., Li, C.M., Many\u00e0, F., Zhu, Z.: A SAT-based approach to MinSAT. In: Proceedings of the 15th International Conference of the Catalan Association for Artificial Intelligence, CCIA 2012, Alacant, Spain, pp. 185\u2013189. IOS Press (2012)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11527695_1","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Ans\u00f3tegui","year":"2005","unstructured":"Ans\u00f3tegui, C., Many\u00e0, F.: Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 1\u201315. Springer, Heidelberg (2005)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-02777-2_17","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"J. Argelich","year":"2009","unstructured":"Argelich, J., Cabiscol, A., Lynce, I., Many\u00e0, F.: Sequential Encodings from Max-CSP into Partial Max-SAT. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 161\u2013166. Springer, Heidelberg (2009)"},{"issue":"1-3","key":"13_CR5","first-page":"3","volume":"19","author":"J. Argelich","year":"2012","unstructured":"Argelich, J., Cabiscol, A., Lynce, I., Many\u00e0, F.: Efficient encodings from CSP into SAT, and from MaxCSP into MaxSAT. Multiple-Valued Logic and Soft Computing\u00a019(1-3), 3\u201323 (2012)","journal-title":"Multiple-Valued Logic and Soft Computing"},{"key":"13_CR6","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":"13_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/ISMVL.2001.924576","volume-title":"Proceedings, 31st International Symposium on Multiple-Valued Logics (ISMVL)","author":"R. B\u00e9jar","year":"2001","unstructured":"B\u00e9jar, R., H\u00e4hnle, R., Many\u00e0, F.: A modular reduction of regular logic to classical logic. In: Proceedings, 31st International Symposium on Multiple-Valued Logics (ISMVL), Warsaw, Poland, pp. 221\u2013226. IEEE CS Press, Los Alamitos (2001)"},{"key":"13_CR8","unstructured":"Culberson, J.: Graph coloring page: The flat graph generator (1995), http:\/\/web.cs.ualberta.ca\/~joe\/Coloring\/Generators\/flat.html"},{"key":"13_CR9","unstructured":"Gent, I.P.: Arc consistency in SAT. In: Proceedings of the 15th European Conference on Artificial Intelligence, ECAI, Lyon, France, pp. 121\u2013125 (2002)"},{"key":"13_CR10","unstructured":"Gent, I.P., Nightingale, P.: A new encoding of AllDifferent into SAT. In: Proceedings of the 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, CP 2004 Workshop, Toronto, Canada, pp. 95\u2013110 (2004)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Heras, F., Morgado, A., Planes, J., Marques-Silva, J.: Iterative SAT solving for minimum satisfiability. In: Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, ICTAI 2012, Athens, Greece, pp. 922\u2013927 (2012)","DOI":"10.1109\/ICTAI.2012.129"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0004-3702(90)90009-O","volume":"45","author":"S. Kasif","year":"1990","unstructured":"Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence\u00a045, 275\u2013286 (1990)","journal-title":"Artificial Intelligence"},{"key":"13_CR13","series-title":"LNCS","first-page":"431","volume-title":"LION 6","author":"A. K\u00fcgel","year":"2012","unstructured":"K\u00fcgel, A.: Natural Max-SAT encoding of Min-SAT. In: Hamadi, Y., Schoenauer, M. (eds.) LION 6. LNCS, vol.\u00a07219, pp. 431\u2013436. Springer, Heidelberg (2012)"},{"key":"13_CR14","unstructured":"Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for weighted CSP. In: Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 2003, Acapulco, M\u00e9xico, pp. 239\u2013244 (2003)"},{"key":"13_CR15","unstructured":"Lecoutre, C., Tabary, S.: Abscon 112: Towards more robustness. In: Proceedings of the 3rd International Constraint Solver Competition in CP 2008 (2008)"},{"key":"13_CR16","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)"},{"key":"13_CR17","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":"13_CR18","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":"13_CR19","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":"13_CR20","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.artint.2012.05.004","volume":"190","author":"C.M. Li","year":"2012","unstructured":"Li, C.M., Zhu, Z., Many\u00e0, F., Simon, L.: Optimizing with minimum satisfiability. Artificial Intelligence\u00a0190, 32\u201344 (2012)","journal-title":"Artificial Intelligence"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","volume":"81","author":"B.M. Smith","year":"1996","unstructured":"Smith, B.M., Dyer, M.E.: Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence\u00a081, 155\u2013181 (1996)","journal-title":"Artificial Intelligence"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-642-33558-7_34","volume-title":"Principles and Practice of Constraint Programming","author":"Z. Zhu","year":"2012","unstructured":"Zhu, Z., Li, C.-M., Many\u00e0, F., Argelich, J.: A New Encoding from MinSAT into MaxSAT. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 455\u2013463. Springer, Heidelberg (2012)"}],"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-40627-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T07:09:22Z","timestamp":1688454562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}