Download PDFOpen PDF in browserOn Solving MaxSAT Through SAT8 pages•Published: May 15, 2012AbstractIn 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.Keyphrases: optimization, satisfiability In: Daniel Le Berre (editor). POS-10. Pragmatics of SAT, vol 8, pages 41-48.
|