Local-search Extraction of MUSes

SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and extract minimally unsatisfiable subformulas (in short, MUSes) of unsatisfiable SAT instances. It is based on an original counting heuristic grafted to a local search algorithm, which explores the neighborhood of the current interpretation in an original manner, making use of a critical clause concept. Intuitively, a critical clause is a falsified clause that becomes true thanks to a local search flip only when some other clauses become false at the same time. In the paper, the critical clause concept is investigated. It is shown to be the cornerstone of the efficiency of our approach, which outperforms competing ones to compute MUSes, inconsistent covers and sets of MUSes, most of the time.

[1]  Antoni Ligęza.  Toward logical analysis of tabular rule‐based systems * , 2001 .

[2]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

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

[4]  Éric Grégoire,et al.  Overcoming the Christmas tree syndrome , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.

[5]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[6]  Renato Bruni,et al.  On exact selection of minimally unsatisfiable subformulae , 2005, Annals of Mathematics and Artificial Intelligence.

[7]  Inês Lynce,et al.  Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel , 2006, SAT.

[8]  Hans Kleine Büning,et al.  On subclasses of minimal unsatisfiable formulas , 2000, Discret. Appl. Math..

[9]  Karem A. Sakallah,et al.  On Finding All Minimally Unsatisfiable Subformulas , 2005, SAT.

[10]  Éric Grégoire,et al.  Overcoming the Christmas Tree Syndrome , 2000, Int. J. Artif. Intell. Tools.

[11]  Henry Kautz,et al.  Walksat in the 2004 SAT Competition , 2004 .

[12]  Inês Lynce,et al.  A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas , 2005, SAT.

[13]  Luca Console,et al.  Readings in Model-Based Diagnosis , 1992 .

[14]  Igor L. Markov,et al.  AMUSE: a minimally-unsatisfiable subformula extractor , 2004, Proceedings. 41st Design Automation Conference, 2004..

[15]  Journal of the Association for Computing Machinery , 1961, Nature.

[16]  Sharad Malik,et al.  Extracting small unsatis able cores from unsatis able boolean formulas , 2003 .

[17]  Georg Gottlob,et al.  On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..

[18]  Georg Gottlob,et al.  Complexity of Propositional Knowledge Base Revision , 1992, CNKBS.

[19]  Inês Lynce,et al.  On Computing Minimum Unsatisfiable Cores , 2004, SAT.

[20]  Renato Bruni,et al.  Approximating minimal unsatisfiable subformulae by means of adaptive core search , 2003, Discret. Appl. Math..

[21]  Éric Grégoire,et al.  Boosting a Complete Technique to Find MSS and MUS Thanks to a Local Search Oracle , 2007, IJCAI.

[22]  Lakhdar Sais,et al.  Boosting complete techniques thanks to local search methods , 1998, Annals of Mathematics and Artificial Intelligence.

[23]  Hans Kleine Büning,et al.  An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF , 1998, Annals of Mathematics and Artificial Intelligence.

[24]  Christos H. Papadimitriou,et al.  The Complexity of Facets Resolved , 1988, J. Comput. Syst. Sci..

[25]  Georg Gottlob,et al.  On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals , 1992, Artif. Intell..

[26]  Stefan Szeider,et al.  Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference , 2002, Theor. Comput. Sci..

[27]  Ulrich Junker.  Conflict Detection for Arbitrary Constraint Propagation Algorithms , 2001 .

[28]  Éric Grégoire,et al.  Checking depth‐limited consistency and inconsistency in knowledge‐based systems , 2001 .

[29]  Lakhdar Sais,et al.  Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently , 2002, AIMSA.

[30]  Jinbo Huang,et al.  MUP: a minimal unsatisfiability prover , 2005, ASP-DAC.