Rotation Based MSS/MCS Enumeration
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00115569" target="_blank" >RIV/00216224:14330/20:00115569 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.29007/8btb" target="_blank" >http://dx.doi.org/10.29007/8btb</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.29007/8btb" target="_blank" >10.29007/8btb</a>
Alternative languages
Result language
angličtina
Original language name
Rotation Based MSS/MCS Enumeration
Original language description
Given an unsatisfiable Boolean Formula F in CNF, i.e., a set of clauses, one is often interested in identifying Maximal Satisfiable Subsets (MSSes) of F or, equivalently, the complements of MSSes called Minimal Correction Subsets (MCSes). Since MSSes (MCSes) find applications in many domains, e.g. diagnosis, ontologies debugging, or axiom pinpointing, several MSS enumeration algorithms have been proposed. Unfortunately, finding even a single MSS is often very hard since it naturally subsumes repeatedly solving the satisfiability problem. Moreover, there can be up to exponentially many MSSes, thus their complete enumeration is often practically intractable. Therefore, the algorithms tend to identify as many MSSes as possible within a given time limit. In this work, we present a novel MSS enumeration algorithm called RIME. Compared to existing algorithms, RIME is much more frugal in the number of performed satisfiability checks which we witness via an experimental comparison. Moreover, RIME is several times faster than existing tools.
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
LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
ISBN
—
ISSN
2398-7340
e-ISSN
—
Number of pages
18
Pages from-to
120-137
Publisher name
EPiC Series in Computing
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
—