Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis1

Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Arthur Choi, Adnan Darwiche, Ewald Speckenmeyer, Chu Min Li, Vasco Manquinho, Armando Tacchella
2008 Journal on Satisfiability, Boolean Modeling and Computation  
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based on formula compilation that allows it to search in a reduced search space. We study how additional techniques from the SAT and Max-SAT literature affect the performance of Clone on problems from the evaluation. We then perform further investigations on factors that may affect the performance of leading Max-SAT solvers.
more » ... e empirically identify two properties of weighted Max-SAT problems that can be used to adjust the difficulty level of the problems with respect to the considered solvers. * This work extends our previous work in [1]
doi:10.3233/sat190044 fatcat:dkx5duodpnh5pc7r7chagvv4vq