Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel

Finding out that a SAT problem instance F is unsatisfiable is not enough for applications, where good reasons are needed for explaining the inconsistency (so that for example the inconsistency may be repaired). Previous attempts of finding such good reasons focused on finding some minimally unsatisfiable sub-clause-set F' of F, which in general suffers from the non-uniqueness of F' (and thus it will only find some reason, albeit there might be others). In our work, we develop a fuller approach, enabling a more fine-grained analysis of necessity and redundancy of clauses, supported by meaningful semantical and proof-theoretical characterisations. We combine known techniques for searching and enumerating minimally unsatisfiable sub-clause-sets with (full) autarky search. To illustrate our techniques, we give a detailed analysis of well-known industrial problem instances.

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

[2]  Helmut Veith,et al.  Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis , 2002, FMCAD.

[3]  Sharad Malik,et al.  Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms , 2003, SAT.

[4]  Antonio Sassano,et al.  Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae , 2001, Electron. Notes Discret. Math..

[5]  Stephen A. Cook,et al.  A short proof of the pigeon hole principle using extended resolution , 1976, SIGA.

[6]  Oliver Kullmann,et al.  New Methods for 3-SAT Decision and Worst-case Analysis , 1999, Theor. Comput. Sci..

[7]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

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

[9]  Shaohan Ma,et al.  A polynomial-time algorithm for reducing the number of variables in MAX SAT problem , 1997 .

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

[11]  Eugene Goldberg,et al.  Verification of proofs of unsatisfiability for CNF formulas , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

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

[13]  Oliver Kullmann.  On the use of autarkies for satisfiability decision , 2001, Electron. Notes Discret. Math..

[14]  Nathan Linial,et al.  Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas , 1986, J. Comb. Theory, Ser. A.

[15]  Oliver Kullmann,et al.  An application of matroid theory to the SAT problem , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

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

[17]  Oliver Kullmann,et al.  On a Generalization of Extended Resolution , 1999, Discret. Appl. Math..

[18]  Rob A. Rutenbar,et al.  Satisfiability-based layout revisited: detailed routing of complex FPGAs via search-based Boolean SAT , 1999, FPGA '99.

[19]  Oliver Kullmann,et al.  Investigations on autark assignments , 2000, Discret. Appl. Math..

[20]  Oliver Kullmann,et al.  Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems , 2004, Annals of Mathematics and Artificial Intelligence.

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

[22]  Oliver Kullmann,et al.  Lean clause-sets: generalizations of minimally unsatisfiable clause-sets , 2003, Discret. Appl. Math..

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

[24]  Claude Berge,et al.  Hypergraphs - combinatorics of finite sets , 1989, North-Holland mathematical library.

[25]  Peter J. Stuckey,et al.  Finding all minimal unsatisfiable subsets , 2003, PPDP '03.

[26]  Ofer Strichman,et al.  Bounded model checking , 2003, Adv. Comput..

[27]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[28]  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.