Publications

An Efficient Solver for Weighted Max-SAT

Publication Type:

Journal Article

Source:

Journal of Global Optimization, Volume 41, Number 1, p.61-73 (2008)

Abstract:

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