{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:24Z","timestamp":1725512004014},"publisher-location":"Berlin, Heidelberg","reference-count":23,"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_1","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T08:04:57Z","timestamp":1210061097000},"page":"1-14","source":"Crossref","is-referenced-by-count":7,"title":["Modelling Max-CSP as Partial Max-SAT"],"prefix":"10.1007","author":[{"given":"Josep","family":"Argelich","sequence":"first","affiliation":[]},{"given":"Alba","family":"Cabiscol","sequence":"additional","affiliation":[]},{"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/11499107_27","volume-title":"Theory and Applications of Satisfiability Testing","author":"T. Alsinet","year":"2005","unstructured":"Alsinet, T., Many\u00e0, F., Planes, J.: Improved exact solver for weighted Max-SAT. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 371\u2013377. Springer, Heidelberg (2005)"},{"issue":"4\u20135","key":"1_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":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-72788-0_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"J. Argelich","year":"2007","unstructured":"Argelich, J., Many\u00e0, F.: Partial Max-SAT solvers with clause learning. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 28\u201340. Springer, Heidelberg (2007)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-3-540-24605-3_23","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Hebrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 299\u2013314. Springer, Heidelberg (2004)"},{"key":"1_CR5","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\u20139","key":"1_CR6","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":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Een","year":"2004","unstructured":"Een, N., Sorensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z. Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 252\u2013265. Springer, Heidelberg (2006)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/978-3-540-74970-7_59","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"M. Gavanelli","year":"2007","unstructured":"Gavanelli, M.: The log-support encoding of CSP into SAT. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 815\u2013822. Springer, Heidelberg (2007)"},{"key":"1_CR10","unstructured":"G\u00e9nisson, R., J\u00e9gou, P.: Davis and Putnam were already checking forward. In: Proceedings of the ECAI-1996, pp. 180\u2013184 (1996)"},{"key":"1_CR11","unstructured":"Gent, I.P.: Arc consistency in SAT. In: Proceedings of ECAI-2002, pp. 121\u2013125 (2002)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: A new weighted Max-SAT solver. In: Proceedings of SAT-2007 (2007)","DOI":"10.1007\/978-3-540-72788-0_8"},{"key":"1_CR13","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":"1_CR14","first-page":"193","volume-title":"Proceedings of IJCAI-2005","author":"J. Larrosa","year":"2005","unstructured":"Larrosa, J., Heras, F.: Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In: Proceedings of IJCAI-2005, Edinburgh, Scotland, pp. 193\u2013198. Morgan Kaufmann, San Francisco (2005)"},{"issue":"2\u20133","key":"1_CR15","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\u20133), 204\u2013233 (2008)","journal-title":"Artificial Intelligence"},{"key":"1_CR16","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":"1_CR17","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In: Proceedings of AAAI-2006, pp. 86\u201391 (2006)"},{"key":"1_CR18","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":"1_CR19","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Planes, J.: Algorithms for Maximum Satisfiability using Unsatisfiable Cores. In: Proceedings of DATE-2008 (2008)","DOI":"10.1109\/DATE.2008.4484715"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: 39th Design Automation Conference (2001)","DOI":"10.1145\/378239.379017"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Pipatsrisawat, K., Darwiche, A.: Clone: Solving weighted max-sat in a reduced search space. In: 20th Australian Joint Conference on Artificial Intelligence, AI-2007, pp. 223\u2013233 (2007)","DOI":"10.1007\/978-3-540-76928-6_24"},{"key":"1_CR22","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)"},{"key":"1_CR23","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)"}],"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_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:29:08Z","timestamp":1619522948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79719-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797180","9783540797197"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79719-7_1","relation":{},"subject":[]}}