A Max-SAT Solver with Lazy Data Structures

We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. We provide experimental evidence that our solver outperforms some of the best performing MaxSAT solvers on a wide range of instances.

• Type: Conference
• Year: 2004
• Where: IBERAMIA
• Authors: Teresa Alsinet, Felip Manyà, Jordi Planes
• Keywords: Artificial Intelligence, IBERAMIA 2004, Lower Bound, Original Lazy Data, Variable Selection Heuristics