Replication-Guided Enumeration of Minimal Unsatisfiable Subsets
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00116179" target="_blank" >RIV/00216224:14330/20:00116179 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-58475-7_3" target="_blank" >http://dx.doi.org/10.1007/978-3-030-58475-7_3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-58475-7_3" target="_blank" >10.1007/978-3-030-58475-7_3</a>
Alternative languages
Result language
angličtina
Original language name
Replication-Guided Enumeration of Minimal Unsatisfiable Subsets
Original language description
In many areas of computer science, we are given an unsatisfiable Boolean formula F in CNF, i.e. a set of clauses, with the goal to identify minimal unsatisfiable subsets (MUSes) of F. The more MUSes are identified, the better insight into F’s unsatisfiability is obtained. Unfortunately, finding even a single MUS can be very time consuming since it naturally subsumes repeatedly solving the satisfiability problem, and thus a complete MUS enumeration is often practically intractable. Therefore, contemporary MUS enumeration algorithms tend to identify as many MUSes as possible within a given time limit. In this work, we present a novel MUS enumeration algorithm. Compared to existing algorithms, our algorithm is much more frugal in the number of performed satisfiability checks. Consequently, our algorithm is often able to find substantially more MUSes than contemporary algorithms.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10200 - Computer and information sciences
Result continuities
Project
<a href="/en/project/EF16_019%2F0000822" target="_blank" >EF16_019/0000822: CyberSecurity, CyberCrime and Critical Information Infrastructures Center of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
26th International Conference on Principles and Practice of Constraint Programming
ISBN
9783030584740
ISSN
0302-9743
e-ISSN
—
Number of pages
18
Pages from-to
37-54
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
—