Replication-Guided Enumeration of Minimal Unsatisfiable Subsets

D 2020

Replication-Guided Enumeration of Minimal Unsatisfiable Subsets

BENDÍK, Jaroslav and Ivana ČERNÁ

Basic information

Original name

Replication-Guided Enumeration of Minimal Unsatisfiable Subsets

Authors

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

Edition

Neuveden, 26th International Conference on Principles and Practice of Constraint Programming, p. 37-54, 18 pp. 2020

Publisher

Springer, Cham

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

printed version "print"

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/20:00116179

Organization unit

Faculty of Informatics

ISBN

978-3-030-58474-0

ISSN

DOI

http://dx.doi.org/10.1007/978-3-030-58475-7_3

Keywords in English

Minimal Unsatisfiable Subsets;MUSes;Over-constrained systems

Abstract

V originále

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.

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Á. Replication-Guided Enumeration of Minimal Unsatisfiable Subsets. In Helmut Simonis. 26th International Conference on Principles and Practice of Constraint Programming. Neuveden: Springer, Cham, 2020, p. 37-54. ISBN 978-3-030-58474-0. Available from: https://dx.doi.org/10.1007/978-3-030-58475-7_3.

@inproceedings{1673818,
   author = {Bendík, Jaroslav and Černá, Ivana},
   address = {Neuveden},
   booktitle = {26th International Conference on Principles and Practice of Constraint Programming},
   doi = {http://dx.doi.org/10.1007/978-3-030-58475-7_3},
   editor = {Helmut Simonis},
   keywords = {Minimal Unsatisfiable Subsets;MUSes;Over-constrained systems},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Neuveden},
   isbn = {978-3-030-58474-0},
   pages = {37-54},
   publisher = {Springer, Cham},
   title = {Replication-Guided Enumeration of Minimal Unsatisfiable Subsets},
   year = {2020}
}

TY  - JOUR
ID  - 1673818
AU  - Bendík, Jaroslav - Černá, Ivana
PY  - 2020
TI  - Replication-Guided Enumeration of Minimal Unsatisfiable Subsets
PB  - Springer, Cham
CY  - Neuveden
SN  - 9783030584740
KW  - Minimal Unsatisfiable Subsets;MUSes;Over-constrained systems
N2  - 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.
ER  -

BENDÍK, Jaroslav and Ivana ČERNÁ. Replication-Guided Enumeration of Minimal Unsatisfiable Subsets. In Helmut Simonis. \textit{26th International Conference on Principles and Practice of Constraint Programming}. Neuveden: Springer, Cham, 2020, p.~37-54. ISBN~978-3-030-58474-0. Available from: https://dx.doi.org/10.1007/978-3-030-58475-7\_{}3.

Detailed Information on Publication Record