A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems

Even when it has been shown that no solution exists for a particular constraint satisfaction problem, one may still aim to restore consistency by relaxing the minimal number of constraints. In the context of a Boolean formula like SAT, such a relaxation is referred to as a Minimal Correction Subset (MCS). In the context of SAT, identifying MCSs for an instance is relevant in a wide range of applications, including MaxSAT solution approximation and Minimal Unsatisfiable Subset (MUS) enumeration. However, while there are a number of existing approaches to this problem, in this paper we demonstrate how performance can be significantly improved by employing algorithm portfolios. Yet, instead of applying the standard approach of selecting a single solver for the instance at hand, we present a new technique that within a predetermined timeout switches between enumeration algorithms multiple times. Through experimental study, this new approach is shown to outperform any possible optimal portfolio that solely relies on solvers that run uninterrupted for the allotted time.

[1]  Yuri Malitsky,et al.  Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation , 2012, CPAIOR.

[2]  Kevin Leyton-Brown,et al.  SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..

[3]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[4]  Alexander Felfernig,et al.  An efficient diagnosis algorithm for inconsistent constraint sets , 2011, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[5]  Lars Kotthoff,et al.  An evaluation of machine learning in algorithm selection for search problems , 2012, AI Commun..

[6]  Rina Dechter,et al.  On computing minimal models , 1993, Annals of Mathematics and Artificial Intelligence.

[7]  Ulrich Junker,et al.  QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems , 2004, AAAI.

[8]  Michael J. Maher,et al.  Over-Constrained Systems , 1995, Lecture Notes in Computer Science.

[9]  Eoin O'Mahony,et al.  Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving ? , 2008 .

[10]  Mikolás Janota,et al.  Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence On Computing Minimal Correction Subsets , 2022 .

[11]  James Bailey,et al.  Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization , 2005, PADL.

[12]  Nicolas Beldiceanu,et al.  9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR'12) , 2012 .

[13]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[14]  Luca Pulina,et al.  A self-adaptive multi-engine solver for quantified Boolean formulas , 2009, Constraints.

[15]  Karem A. Sakallah,et al.  Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints , 2007, Journal of Automated Reasoning.

[16]  Barry O'Sullivan,et al.  Generating Corrective Explanations for Interactive Constraint Satisfaction , 2005, CP.

[17]  Wolfgang Küchlin,et al.  Formal methods for the validation of automotive product configuration data , 2003, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[18]  Katsumi Inoue,et al.  Identifying Necessary Reactions in Metabolic Pathways by Minimal Model Generation , 2010, ECAI.

[19]  Risto Miikkulainen,et al.  Latent class models for algorithm portfolio methods , 2010, AAAI 2010.

[20]  Barry O'Sullivan,et al.  SNNAP: Solver-Based Nearest Neighbor for Algorithm Portfolios , 2013, ECML/PKDD.

[21]  Yuri Malitsky,et al.  Algorithm Selection and Scheduling , 2011, CP.

[22]  Barry O'Sullivan,et al.  Adaptation in a CBR-Based Solver Portfolio for the Satisfiability Problem , 2012, ICCBR.

[23]  Peter A. Flach,et al.  Evaluation Measures for Multi-class Subgroup Discovery , 2009, ECML/PKDD.

[24]  Eliezer L. Lozinskii,et al.  Consistent subsets of inconsistent systems: structure and behaviour , 2003, J. Exp. Theor. Artif. Intell..

[25]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[26]  Luc Lamontagne,et al.  Case-Based Reasoning Research and Development , 1997, Lecture Notes in Computer Science.