Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems
Refereed Conference Meeting Proceeding
Constraint satisfaction and boolean satisfiability (SAT) are common approaches to modeling and solving combinatorial problems. It is often the case that a problem does not admit a solution; we refer to such problems as being inconsistent or over-constrained. In these cases we may be interested in finding the minimal subset of constraints, or clauses in SAT, that if removed from the problem would allow a solution to be found. This minimal number of constraints is referred to as a Minimal Correction Subset (MCS).
ECAI 2014 - 21st European Conference on Artificial Intelligence
21st European Conference on Artificial Intelligence- Frontiers in Artificial Intelligence and Applications
Digital Object Identifer (DOI):
National University of Ireland, Cork (UCC)
Open access repository: