Approximate Counting of Minimal Unsatisfiable Subsets

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00115568" target="_blank" >RIV/00216224:14330/20:00115568 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-030-53288-8_21" target="_blank" >http://dx.doi.org/10.1007/978-3-030-53288-8_21</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-53288-8_21" target="_blank" >10.1007/978-3-030-53288-8_21</a>

Result language

angličtina

Original language name

Approximate Counting of Minimal Unsatisfiable Subsets

Original language description

Given an unsatisfiable formula F in CNF, i.e. a set of clauses, the problem of Minimal Unsatisfiable Subset (MUS) seeks to identify the minimal subset of clauses N subset F such that N is unsatisfiable. The emerging viewpoint of MUSes as the root causes of unsatisfiability has led MUSes to find applications in a wide variety of diagnostic approaches. Recent advances in finding and enumeration of MUSes have motivated researchers to discover applications that can benefit from rich information about the set of MUSes. One such extension is that of counting the number of MUSes, which has shown to describe the inconsistency metrics for general propositional knowledge bases. The current best approach for MUS counting is to employ a MUS enumeration algorithm, which often does not scale for the cases with a reasonably large number of MUSes. Motivated by the success of hashing-based techniques in the context of model counting, we design the first approximate counting procedure with (epsilon,delta) guarantees, called AMUSIC. Our approach avoids exhaustive MUS enumeration by combining the classical technique of universal hashing with advances in QBF solvers along with a novel usage of union and intersection of MUSes to achieve runtime efficiency. Our prototype implementation of AMUSIC is shown to scale to instances that were clearly beyond the reach of enumeration-based approaches.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10200 - Computer and information sciences

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2020

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Computer Aided Verification - 32nd International Conference, CAV 2020

ISBN

9783030532871

ISSN

0302-9743

e-ISSN

1611-3349

Number of pages

24

Pages from-to

439-462

Publisher name

Springer, Cham

Place of publication

Neuveden

Event location

Online

Event date

Jan 1, 2020

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000695276000021