{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:27:39Z","timestamp":1740461259732,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"abstract":"<jats:p>In this paper we present a Partial MaxSAT solver based on successive calls to a SAT solver. At the kth iteration the SAT solver tries to certify that there exist an assignment that satisfies all but k clauses. The key idea is to add an additional variable to each soft clause and to introduce, at each iteration, at-least and at-most cardinality constraints restricting the possible values of these variables. We prove the correctness of our algorithm and compare it with other (Partial) MaxSAT solvers.<\/jats:p>","DOI":"10.3233\/978-1-60750-061-2-284","type":"book-chapter","created":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T11:59:50Z","timestamp":1740398390000},"source":"Crossref","is-referenced-by-count":0,"title":["On Solving MaxSAT Through SAT"],"prefix":"10.3233","author":[{"family":"Ans&oacute;tegui Carlos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Bonet Mar&iacute;a Luisa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Levy Jordi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Artificial Intelligence Research and Development"],"original-title":[],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T12:27:49Z","timestamp":1740400069000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=202&spage=284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-60750-061-2-284","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2009]]}}}