An efficient solver for weighted Max-SAT


We present a new branch and bound algorithm for weighted Max-SAT, called 1 Lazy which incorporates original data structures and inference rules, as well as a lower 2 bound of better quality. We provide experimental evidence that our solver is very competi3 tive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers 4 on a wide range of instances. 5

DOI: 10.1007/s10898-007-9166-9

6 Figures and Tables

Cite this paper

@article{Alsinet2008AnES, title={An efficient solver for weighted Max-SAT}, author={Teresa Alsinet and Felip Many{\`a} and Jordi Planes}, journal={J. Global Optimization}, year={2008}, volume={41}, pages={61-73} }