Core-Guided Minimal Correction Set and Core Enumeration

A set of constraints is unsatisfiable if there is no solution that satisfies these constraints. To analyse unsatisfiable problems, the user needs to understand where inconsistencies come from and how they can be repaired. Minimal unsatisfiable cores and correction sets are important subsets of constraints that enable such analysis. In this work, we propose a new algorithm for extracting minimal unsatisfiable cores and correction sets simultaneously. Building on top of the relaxation and strengthening framework, we introduce novel techniques for extracting these sets. Our new solver significantly outperforms several state of the art algorithms on common benchmarks when it comes to extracting correction sets and compares favorably on core extraction.

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

[2]  Nina Narodytska,et al.  Cores in Core Based MaxSat Algorithms: An Analysis , 2014, SAT.

[3]  Fahiem Bacchus,et al.  Relaxation Search: A Simple Way of Managing Optional Clauses , 2014, AAAI.

[4]  Joao Marques-Silva,et al.  Algorithms for Maximum Satisfiability using Unsatisfiable Cores , 2008, 2008 Design, Automation and Test in Europe.

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

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

[7]  Karem A. Sakallah,et al.  Reveal: A Formal Verification Tool for Verilog Designs , 2008, LPAR.

[8]  Torsten Schaub,et al.  Unsatisfiability-based optimization in clasp , 2012, ICLP.

[9]  Mario Alviano,et al.  A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size , 2015, IJCAI.

[10]  Karem A. Sakallah,et al.  Generalizing Core-Guided Max-SAT , 2009, SAT.

[11]  Stephan Schulz,et al.  Simple and Efficient Clause Subsumption with Feature Vector Indexing , 2013, Automated Reasoning and Mathematics.

[12]  Nina Narodytska,et al.  Maximum Satisfiability Using Core-Guided MaxSAT Resolution , 2014, AAAI.

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

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

[15]  Michael Kaufmann,et al.  A New Approach to Partial MUS Enumeration , 2015, SAT.

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

[17]  Joao Marques-Silva,et al.  Accelerating MUS extraction with recursive model rotation , 2011, 2011 Formal Methods in Computer-Aided Design (FMCAD).

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

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

[20]  Fahiem Bacchus,et al.  Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets , 2015, CAV.

[21]  Sharad Malik,et al.  On Solving the Partial MAX-SAT Problem , 2006, SAT.

[22]  Joao Marques-Silva,et al.  MaxSAT-Based MCS Enumeration , 2012, Haifa Verification Conference.

[23]  Zhao Wenting,et al.  Parallelizing Partial MUS Enumeration , 2016 .