MCSes Enumeration with the Glucose SAT Solver

Abstract

Enumerating all Maximal Satisfiable Subsets (MSSes) or all Minimal Correction Subsets (MCSes) of an unsatisfiable CNF Boolean formula is a cornerstone task in various AI domains. This paper considers MCSes enumeration with a SAT solver. We aim to develop a procedure which outperforms several MCSes enumerators proposed so far. The paper presents a basic enumeration procedure and compares it with a state-of-the-art enumerator Enum-ELS-RMR-Cache. The experimental results show that the proposed procedure is more efficient than Enum-ELS-RMR-Cache to solve Partial-MaxSAT instances but it is inefficient than Enum-ELS-RMR-Cache to solve plain MaxSAT instances.