On Solving MaxSAT Through SAT

8 pages•Published: May 15, 2012

Carlos Ansótegui, María Luisa Bonet and Jordi Levy

Abstract

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.

Keyphrases: optimization, satisfiability

In: Daniel Le Berre (editor). POS-10. Pragmatics of SAT, vol 8, pages 41-48.

Links:	https://easychair.org/publications/paper/Z8
	https://doi.org/10.29007/vxm5

BibTeX entry

@inproceedings{POS-10:Solving_MaxSAT_Through_SAT,
  author    = {Carlos Ansótegui and María Luisa Bonet and Jordi Levy},
  title     = {On Solving MaxSAT Through SAT},
  booktitle = {POS-10. Pragmatics of SAT},
  editor    = {Daniel Le Berre},
  series    = {EPiC Series in Computing},
  volume    = {8},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Z8},
  doi       = {10.29007/vxm5},
  pages     = {41-48},
  year      = {2012}}

Download PDF Open PDF in browser