On Computing the Union of MUSes

This paper considers unsatisfiable CNF formulas and addresses the problem of computing the union of the clauses included in some minimally unsatisfiable subformula (MUS). The union of MUSes represents a useful notion in infeasibility analysis since it summarizes all the causes for the unsatisfiability of a given formula. The paper proposes a novel algorithm for this problem, developing a refined recursive enumeration of MUSes based on powerful pruning techniques. Experimental results indicate the practical suitability of the approach.

[1]  Frank van Harmelen,et al.  Debugging Incoherent Terminologies , 2007, Journal of Automated Reasoning.

[2]  Mikolás Janota,et al.  Quantified maximum satisfiability , 2015, Constraints.

[3]  Dietmar Jannach,et al.  Model-based diagnosis of spreadsheet programs: a constraint-based debugging approach , 2016, Automated Software Engineering.

[4]  Nikolaj Bjørner,et al.  Core-Guided Minimal Correction Set and Core Enumeration , 2018, IJCAI.

[5]  Jérôme Lang.  Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden , 2018, IJCAI.

[6]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[7]  Andreas G. Veneris.  Fault diagnosis and logic debugging using Boolean satisfiability , 2003, Proceedings. 4th International Workshop on Microprocessor Test and Verification - Common Challenges and Solutions.

[8]  Franz Wotawa,et al.  Fragment-based spreadsheet debugging , 2018, Automated Software Engineering.

[9]  Paolo Liberatore,et al.  Redundancy in logic I: CNF propositional formulae , 2002, Artif. Intell..

[10]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[11]  Mikolás Janota,et al.  On Deciding MUS Membership with QBF , 2011, CP.

[12]  Inês Lynce,et al.  Towards efficient MUS extraction , 2012, AI Commun..

[13]  Rupak Majumdar,et al.  Cause clue clauses: error localization using maximum satisfiability , 2010, PLDI '11.

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

[15]  Rupak Majumdar,et al.  Bug-Assist: Assisting Fault Localization in ANSI-C Programs , 2011, CAV.

[16]  Joao Marques-Silva,et al.  Literal-Based MCS Extraction , 2015, IJCAI.

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

[18]  Vasco M. Manquinho,et al.  Efficient Autarkies , 2014, ECAI.

[19]  Hans Kleine Büning,et al.  Minimal Unsatisfiability and Autarkies , 2009, Handbook of Satisfiability.

[20]  Joao Marques-Silva,et al.  Premise Set Caching for Enumerating Minimal Correction Subsets , 2018, AAAI.

[21]  Peter J. Stuckey,et al.  Interactive type debugging in Haskell , 2003, Haskell '03.

[22]  Fahiem Bacchus,et al.  Finding a Collection of MUSes Incrementally , 2016, CPAIOR.

[23]  Éric Grégoire,et al.  Boosting MCSes Enumeration , 2018, IJCAI.

[24]  Sean Safarpour,et al.  Improved Design Debugging Using Maximum Satisfiability , 2007 .

[25]  Joao Marques-Silva,et al.  MCS Extraction with Sublinear Oracle Queries , 2016, SAT.

[26]  Joao Marques-Silva,et al.  Fast, flexible MUS enumeration , 2015, Constraints.

[27]  Joao Marques-Silva,et al.  Computing Maximal Autarkies with Few and Simple Oracle Queries , 2015, SAT.

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

[29]  Karem A. Sakallah,et al.  Searching for Autarkies to Trim Unsatisfiable Clause Sets , 2008, SAT.

[30]  Joao Marques-Silva,et al.  Improving MCS Enumeration via Caching , 2017, SAT.

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

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