Clone: Solving weighted max-SAT in a reduced search space

Abstract

We introduce a new branch-and-bound Max-SAT solver, Clone, which employs a novel approach for computing lower bounds. This approach allows Clone to search in a reduced space. Moreover, Clone is equipped with novel techniques for learning from soft conflicts. Experimental results show that Clone performs competitively with the leading Max-SAT solver in the broadest category of this year's Max-SAT evaluation and outperforms last year's leading solvers. © Springer-Verlag Berlin Heidelberg 2007.