Solving Max-SAT as Weighted CSP

For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We wanted to see how recent progress in the weighted CSP (WCSP) field could compete with other approaches in related fields. One of these fields is propositional logic and the well-known Max-SAT problem. In this paper, we show how Max-SAT can be encoded as a weighted constraint network, either directly or using a dual encoding. We then solve Max-SAT instances using state-of-the-art algorithms for weighted Max-CSP, dedicated Max-SAT solvers and the state-of-the-art MIP solver CPLEX. The results show that, despite a limited adaptation to CNF structure, WCSP-solver based methods are competitive with existing methods and can even outperform them, especially on the hardest, most over-constrained problems.

• Type: Conference
• Year: 2003
• Where: CP
• Authors: Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex
• Keywords: CP 2003, Max-SAT, Programming Languages, Weighted Constraint Network, Well-known Max-sat Problem