Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1790958, author = {Bendík, Jaroslav and Meel, Kuldeep S.}, address = {Cham}, booktitle = {Computer Aided Verification - 33rd International Conference}, doi = {http://dx.doi.org/10.1007/978-3-030-81688-9_15}, editor = {Alexandra Silva, K. Rustan M. Leino}, keywords = {satisfiability}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Cham}, isbn = {978-3-030-81687-2}, pages = {313-336}, publisher = {Springer}, title = {Counting Minimal Unsatisfiable Subsets}, year = {2021} }
TY - JOUR ID - 1790958 AU - Bendík, Jaroslav - Meel, Kuldeep S. PY - 2021 TI - Counting Minimal Unsatisfiable Subsets PB - Springer CY - Cham SN - 9783030816872 KW - satisfiability N2 - Given 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, Bendik and Meel initiated the study of MUS counting techniques. They succeeded in designing the first approximate MUS counter, AMUSIC, that does not rely on exhaustive MUS enumeration. 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 AMUSIC by designing the first exact MUS counter, CountMUST, that does not rely on exhaustive enumeration. 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 CountMUST successfully returns MUS count for 1500 instances while AMUSIC and enumeration-based techniques could only handle up to 833 instances. ER -
BENDÍK, Jaroslav and Kuldeep S. MEEL. Counting Minimal Unsatisfiable Subsets. In Alexandra Silva, K. Rustan M. Leino. \textit{Computer Aided Verification - 33rd International Conference}. Cham: Springer, 2021, p.~313-336. ISBN~978-3-030-81687-2. Available from: https://dx.doi.org/10.1007/978-3-030-81688-9\_{}15.
|