Model-based Partitioning for MaxSAT Solving
Ruben Martins, Vasco M. Manquinho · 2013
Abstract. Linear search algorithms have been shown to be particularly effective for solving partial Maximum Satisfiability (MaxSAT) problem instances. These algorithms start by adding a new relaxation variable to each soft clause and solving the resulting formula with a SAT solver. Whenever a model is found, a new constraint on the relaxation variables is added such that models with a greater or equal value are excluded. However, if the problem instance has a large number of relaxation vari-ables, then adding a new constraint over these variables can lead to the exploration of a much larger search space. This paper proposes new algorithms that use the models found by the SAT solver to partition the relaxation variables. These algorithms add a new constraint on a subset of relaxation variables, thus intensifying the search on that subspace. Preliminary results show that model-based algorithms can outperform a traditional linear search algorithm in several problem instances. 1