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.
Is part of
Lecture Notes in Computer Science, 2004, vol. 3315, p. 334-342European research projects
Related items
Showing items related by title, author, creator and subject.
-
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
Li, Chu-Min; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2005)One of the main differences between complete SAT solvers and exact Max-SAT solvers is that the former make an intensive use of unit propagation at each node of the proof tree while the latter, in order to ensure optimality, ... -
An efficient solver for weighted Max-SAT
Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi (Springer, 2008)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 ... -
Improved Exact Solvers for Weighted Max-SAT
Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2005)We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ) which incorporate original data structures and inference rules, and a lower bound of better quality