{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T12:43:59Z","timestamp":1666010639276},"reference-count":0,"publisher":"IOS Press","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"abstract":"<jats:p>We define a new MaxSAT tableau calculus based on resolution. Given a multiset of propositional clauses \u03d5, we prove that the calculus is sound in the sense that if the minimum number of contradictions derived among the branches of a completed tableau for \u03d5 is m, then the minimum number of unsatisfied clauses in \u03d5 is m. We also prove that it is complete in the sense that if the minimum number of unsatisfied clauses in \u03d5 is m, then the minimum number of contradictions among the branches of any completed tableau for \u03d5 is m. Moreover, we describe how to extend the proposed calculus to solve Weighted Partial MaxSAT.<\/jats:p>","DOI":"10.3233\/faia220311","type":"book-chapter","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T12:20:18Z","timestamp":1666009218000},"source":"Crossref","is-referenced-by-count":0,"title":["A Tableau Calculus for MaxSAT Based on Resolution"],"prefix":"10.3233","author":[{"given":"Shoulin","family":"Li","sequence":"first","affiliation":[{"name":"Aix Marseille Univ, Universit\u00e9 de Toulon, CNRS, LIS, Marseille, France"}]},{"given":"Jordi","family":"Coll","sequence":"additional","affiliation":[{"name":"Aix Marseille Univ, Universit\u00e9 de Toulon, CNRS, LIS, Marseille, France"}]},{"given":"Djamal","family":"Habet","sequence":"additional","affiliation":[{"name":"Aix Marseille Univ, Universit\u00e9 de Toulon, CNRS, LIS, Marseille, France"}]},{"given":"Chu-Min","family":"Li","sequence":"additional","affiliation":[{"name":"Aix Marseille Univ, Universit\u00e9 de Toulon, CNRS, LIS, Marseille, France"},{"name":"MIS, Universit\u00e9 de Picardie, Amiens, France"}]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Research Institute (IIIA), CSIC, Bellaterra, Spain"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Artificial Intelligence Research and Development"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA220311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T12:20:27Z","timestamp":1666009227000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA220311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia220311","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,17]]}}}