Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems

Constraint satisfaction has become ubiquitous in the modern world, able to model and offer solution techniques for many of the most pressing problems. However, no matter how good the techniques become, some problems just do not have a satisfiable solution, and are referred to as inconsistent. Yet even when such problems are considered, one is still interested in finding the minimal subset of constraints causing the issue. Removing such constraints restores consistency. In the context of Boolean formulas, this minimal number of troublesome constraints is referred to as Minimal Correction Subsets (MCSs). More formally, an MCS can be defined as follows: