An Experimentally Efficient Method for (MSS, CoMSS) Partitioning

The concepts of MSS (Maximal Satisfiable Subset) and CoMSS (also called Minimal Correction Subset) play a key role in many A.I. approaches and techniques. In this paper, a novel algorithm for partitioning a Boolean CNF formula into one MSS and the corresponding CoMSS is introduced. Extensive empirical evaluation shows that it is more robust and more efficient on most instances than currently available techniques.

[1]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

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

[3]  Adnan Darwiche,et al.  A Lightweight Component Caching Scheme for Satisfiability Solvers , 2007, SAT.

[4]  Éric Grégoire,et al.  Logic-based approaches to information fusion , 2006, Inf. Fusion.

[5]  Matthew L. Ginsberg,et al.  Readings in Nonmonotonic Reasoning , 1987, AAAI 1987.

[6]  Éric Grégoire,et al.  Questioning the Importance of WCORE-Like Minimization Steps in MUC-Finding Algorithms , 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.

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

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

[9]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

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

[11]  Gilles Audemard,et al.  Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.

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

[13]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

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

[15]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[16]  Jean-Marie Lagniez,et al.  Dynamic Polarity Adjustment in a Parallel SAT Solver , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[17]  Gilles Audemard,et al.  Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction , 2013, SAT.

[18]  Alexander Felfernig,et al.  An efficient diagnosis algorithm for inconsistent constraint sets , 2011, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

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

[20]  Lakhdar Sais,et al.  Extracting MUCs from Constraint Networks , 2006, ECAI.

[21]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

[22]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[23]  S. Hansson,et al.  Twenty-Five Years of Research in Belief Change , 2011 .

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

[25]  Toby Walsh,et al.  Backbones and Backdoors in Satisfiability , 2005, AAAI.

[26]  Christophe Lecoutre,et al.  Constraint Networks: Techniques and Algorithms , 2009 .

[27]  John W. Chinneck,et al.  Feasibility and Infeasibility in Optimization:: Algorithms and Computational Methods , 2007 .

[28]  Pedro Meseguer,et al.  Current Approaches for Solving Over-Constrained Problems , 2004, Constraints.

[29]  Armin Biere,et al.  Factoring Out Assumptions to Speed Up MUS Extraction , 2013, SAT.

[30]  Lakhdar Sais,et al.  On Freezing and Reactivating Learnt Clauses , 2011, SAT.

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

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

[33]  Sharad Malik,et al.  Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

[34]  Éric Grégoire,et al.  Local-search Extraction of MUSes , 2007, Constraints.

[35]  Anthony Hunter,et al.  Elements of Argumentation , 2007, ECSQARU.

[36]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[37]  Éric Grégoire,et al.  Improving MUC extraction thanks to local search , 2013, ArXiv.

[38]  Gilles Audemard,et al.  Refining Restarts Strategies for SAT and UNSAT , 2012, CP.

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