Structure-Guided Cube-and-Conquer for MaxSAT

Max Bannach, Markus Hecher

Abstract: We present a black-box inprocessor for the partially weighted maximum satisfiability problem, which extends any given MaxSAT solver with inprocessing capabilities without modifying the core solver. Our approach combines the well-established cube-and-conquer technique with classical dynamic programming over a tree decomposition of the formula. While the first technique is limited in the size of the cubes it can handle, the second technique is limited by the treewidth of the input. By combining both paradigms, we cam handle significantly bigger cubes in instances with a treewidth of over a thousand, all without suffering performance losses on unstructured instances.