Rotation Based MSS/MCS Enumeration

D 2020

Rotation Based MSS/MCS Enumeration

BENDÍK, Jaroslav a Ivana ČERNÁ

Základní údaje

Originální název

Rotation Based MSS/MCS Enumeration

Autoři

BENDÍK, Jaroslav (203 Česká republika, garant, domácí) a Ivana ČERNÁ (203 Česká republika, domácí)

Vydání

Neuveden, LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, od s. 120-137, 18 s. 2020

Nakladatel

EPiC Series in Computing

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10200 1.2 Computer and information sciences

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

elektronická verze "online"

Odkazy

URL

Kód RIV

RIV/00216224:14330/20:00115569

Organizační jednotka

Fakulta informatiky

ISSN

DOI

http://dx.doi.org/10.29007/8btb

Klíčová slova anglicky

Maximal Satisfiable Subsets;Minimal Correction Subsets;Infeasibility Analysis;Diagnosis;MSS;MCS

Štítky

core_A, firank_A

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 10. 5. 2021 05:46, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

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.

Návaznosti

EF16_019/0000822, projekt VaV

Název: Centrum excelence pro kyberkriminalitu, kyberbezpečnost a ochranu kritických informačních infrastruktur

MUNI/A/1050/2019, interní kód MU

Název: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace IX (Akronym: SV-FI MAV IX)

Investor: Masarykova univerzita, Rozsáhlé výpočetní systémy: modely, aplikace a verifikace IX, DO R. 2020_Kategorie A - Specifický výzkum - Studentské výzkumné projekty

MUNI/A/1076/2019, interní kód MU

Název: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 20 (Akronym: SKOMU)

Investor: Masarykova univerzita, Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 20, DO R. 2020_Kategorie A - Specifický výzkum - Studentské výzkumné projekty

Citovat

BENDÍK, Jaroslav a Ivana ČERNÁ. Rotation Based MSS/MCS Enumeration. Online. In Elvira Albert and Laura Kovacs. LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Neuveden: EPiC Series in Computing, 2020, s. 120-137. ISSN 2398-7340. Dostupné z: https://dx.doi.org/10.29007/8btb.

@inproceedings{1649417,
   author = {Bendík, Jaroslav and Černá, Ivana},
   address = {Neuveden},
   booktitle = {LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
   doi = {http://dx.doi.org/10.29007/8btb},
   editor = {Elvira Albert and Laura Kovacs},
   keywords = {Maximal Satisfiable Subsets;Minimal Correction Subsets;Infeasibility Analysis;Diagnosis;MSS;MCS},
   howpublished = {elektronická verze "online"},
   language = {eng},
   location = {Neuveden},
   pages = {120-137},
   publisher = {EPiC Series in Computing},
   title = {Rotation Based MSS/MCS Enumeration},
   url = {https://easychair.org/publications/paper/rXZL},
   year = {2020}
}

TY  - JOUR
ID  - 1649417
AU  - Bendík, Jaroslav - Černá, Ivana
PY  - 2020
TI  - Rotation Based MSS/MCS Enumeration
PB  - EPiC Series in Computing
CY  - Neuveden
KW  - Maximal Satisfiable Subsets;Minimal Correction Subsets;Infeasibility Analysis;Diagnosis;MSS;MCS
UR  - https://easychair.org/publications/paper/rXZL
N2  - 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.
ER  -

BENDÍK, Jaroslav a Ivana ČERNÁ. Rotation Based MSS/MCS Enumeration. Online. In Elvira Albert and Laura Kovacs. \textit{LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning}. Neuveden: EPiC Series in Computing, 2020, s.~120-137. ISSN~2398-7340. Dostupné z: https://dx.doi.org/10.29007/8btb.

Podrobný výpis o publikaci