A Max-SAT Solver with Lazy Data Structures
Issue date
2004Suggested citation
Alsinet, Teresa;
Manyà Serres, Felip;
Planes Cid, Jordi;
.
(2004)
.
A Max-SAT Solver with Lazy Data Structures.
Lecture Notes in Computer Science, 2004, vol. 3315, p. 334-342.
https://doi.org/10.1007/978-3-540-30498-2_34.
Metadata
Show full item recordAbstract
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 Max-
SAT solvers on a wide range of instances.