An efficient solver for weighted Max-SAT |
| |
| Authors: | Teresa Alsinet Felip Manyà Jordi Planes |
| |
| Institution: | (1) Computer Science Department, Universitat de Lleida, Jaume II, 69, 25001 Lleida, Spain;(2) Artificial Intelligence Research Institute (IIIA, CSIC), Campus UAB, 08193 Bellaterra, Spain |
| |
| 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. |
| |
| Keywords: | Max-SAT Weighted Branch and bound Lower bound Heuristics Data structures |
| 本文献已被 SpringerLink 等数据库收录！ |
|
