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