Author:
Bendík Jaroslav,Meel Kuldeep S.
Abstract
AbstractGiven an unsatisfiable Boolean formula F in CNF, an unsatisfiable subset of clauses U of F is called Minimal Unsatisfiable Subset (MUS) if every proper subset of U is satisfiable. Since MUSes serve as explanations for the unsatisfiability of F, MUSes find applications in a wide variety of domains. The availability of efficient SAT solvers has aided the development of scalable techniques for finding and enumerating MUSes in the past two decades. Building on the recent developments in the design of scalable model counting techniques for SAT, Bendík and Meel initiated the study of MUS counting techniques. They succeeded in designing the first approximate MUS counter, $$\mathsf {AMUSIC}$$
AMUSIC
, that does not rely on exhaustive MUS enumeration. $$\mathsf {AMUSIC}$$
AMUSIC
, however, suffers from two shortcomings: the lack of exact estimates and limited scalability due to its reliance on 3-QBF solvers.In this work, we address the two shortcomings of $$\mathsf {AMUSIC}$$
AMUSIC
by designing the first exact MUS counter, $$\mathsf {CountMUST}$$
CountMUST
, that does not rely on exhaustive enumeration. $$\mathsf {CountMUST}$$
CountMUST
circumvents the need for 3-QBF solvers by reducing the problem of MUS counting to projected model counting. While projected model counting is #NP-hard, the past few years have witnessed the development of scalable projected model counters. An extensive empirical evaluation demonstrates that $$\mathsf {CountMUST}$$
CountMUST
successfully returns MUS count for 1500 instances while $$\mathsf {AMUSIC}$$
AMUSIC
and enumeration-based techniques could only handle up to 833 instances.
Publisher
Springer International Publishing
Reference69 articles.
1. Andraus, Z.S., Liffiton, M.H., Sakallah, K.A.: CEGAR-based formal hardware verification: a case study. Technical report, University of Michigan, CSE-TR-531-07 (2007)
2. Lecture Notes in Computer Science;MF Arif,2016
3. Lecture Notes in Computer Science;F Bacchus,2015
4. Lecture Notes in Computer Science;F Bacchus,2016
5. Lecture Notes in Computer Science;J Bailey,2005
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献