Rotation Based MSS/MCS Enumeration

D 2020

Rotation Based MSS/MCS Enumeration

BENDÍK, Jaroslav and Ivana ČERNÁ

Basic information

Original name

Rotation Based MSS/MCS Enumeration

Authors

BENDÍK, Jaroslav (203 Czech Republic, guarantor, belonging to the institution) and Ivana ČERNÁ (203 Czech Republic, belonging to the institution)

Edition

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

Publisher

EPiC Series in Computing

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10200 1.2 Computer and information sciences

Confidentiality degree

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

Publication form

electronic version available online

References:

URL

RIV identification code

RIV/00216224:14330/20:00115569

Organization unit

Faculty of Informatics

ISSN

DOI

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

Keywords in English

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

Abstract

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.

Links

EF16_019/0000822, research and development project

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

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

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

Investor: Masaryk University, Category A

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

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

Investor: Masaryk University, Category A

Citovat

BENDÍK, Jaroslav and 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, p. 120-137. ISSN 2398-7340. Available from: 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 and 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, p.~120-137. ISSN~2398-7340. Available from: https://dx.doi.org/10.29007/8btb.

Detailed Information on Publication Record