Community-Based Partitioning for MaxSAT Solving [chapter]

Ruben Martins, Vasco Manquinho, Inês Lynce
2013 Lecture Notes in Computer Science  
Unsatisfiability-based algorithms for Maximum Satisfiability (Max-SAT) have been shown to be very effective in solving several classes of problem instances. These algorithms rely on successive calls to a SAT solver, where an unsatisfiable subformula is identified at each iteration. However, in some cases, the SAT solver returns unnecessarily large subformulas. In this paper a new technique is proposed to partition the MaxSAT formula in order to identify smaller unsatisfiable subformulas at each
more » ... call of the SAT solver. Preliminary experimental results analyze the effect of partitioning the MaxSAT formula into communities. This technique is shown to significantly improve the unsatisfiability-based algorithm for different benchmark sets.
doi:10.1007/978-3-642-39071-5_14 fatcat:bn2hpkewtvgljlrolynqsuesdy