You are here

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

Authors: 

Yuri Malitsky, Barry O'Sullivan, Alessandro Previti, João Marques-Silva:

Publication Type: 
Refereed Conference Meeting Proceeding
Abstract: 
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).
Conference Name: 
ECAI 2014 - 21st European Conference on Artificial Intelligence
Proceedings: 
21st European Conference on Artificial Intelligence- Frontiers in Artificial Intelligence and Applications
Digital Object Identifer (DOI): 
10.3233/978-1-61499-419-0-1065
Publication Date: 
11/09/2014
Volume: 
263
Pages: 
1065-1066
Conference Location: 
Czech Republic
Institution: 
National University of Ireland, Cork (UCC)
Project Acknowledges: 
Open access repository: 
Yes