FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets

In the past few years, much attention has been given to the problem of finding Minimal Unsatisfiable Subsets (MUSes), not only for its theoretical importance but also for its wide range of practical applications, including software testing, hardware verification and knowledge-based validation. In this paper, we propose an algorithm for extracting all MUSes for formulas in the field of propositional logic and the function-free and equality-free fragment of first-order logic. This algorithm extends earlier work, but some changes have been made and a number of optimization strategies have been proposed to improve its efficiency. Experimental results show that our algorithm performs well on many industrial and generated instances, and the strategies adopted can indeed improve the efficiency of our algorithm.

[1]  Geoff Sutcliffe The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.

[2]  Ofer Strichman,et al.  Faster Extraction of High-Level Minimal Unsatisfiable Cores , 2011, SAT.

[3]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[4]  Aimin Hou,et al.  A Theory of Measurement in Diagnosis from First Principles , 1994, Artif. Intell..

[5]  Guohui Xiao,et al.  Inconsistency Measurement based on Variables in Minimal Unsatisfiable Subsets , 2012, ECAI.

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

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

[8]  Geoff Sutcliffe The TPTP Problem Library and Associated Infrastructure , 2017, Journal of Automated Reasoning.

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

[10]  Joao Marques-Silva,et al.  Partial MUS Enumeration , 2013, AAAI.

[11]  Jie Luo,et al.  An Algorithm to Compute Minimal Unsatisfiable Subsets for a Decidable Fragment of First-Order Formulas , 2016, 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI).

[12]  Bart Selman,et al.  Satisfiability Solvers , 2008, Handbook of Knowledge Representation.

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

[14]  Kevin Leyton-Brown,et al.  Tradeoffs in the empirical evaluation of competing algorithm designs , 2010, Annals of Mathematics and Artificial Intelligence.

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

[16]  Meir Kalech,et al.  Exploring the Duality in Conflict-Directed Model-Based Diagnosis , 2012, AAAI.

[17]  Wei Li,et al.  R-calculus without the cut rule , 2011, Science China Information Sciences.

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

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

[20]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[21]  Ju Wang,et al.  R-Calculus: a Logical Approach for Knowledge Base Maintenance , 1995, Int. J. Artif. Intell. Tools.