MUST: Minimal Unsatisfiable Subsets Enumeration Tool

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00115396" target="_blank" >RIV/00216224:14330/20:00115396 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-45190-5_8" target="_blank" >http://dx.doi.org/10.1007/978-3-030-45190-5_8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-45190-5_8" target="_blank" >10.1007/978-3-030-45190-5_8</a>

Result language
angličtina
Original language name
MUST: Minimal Unsatisfiable Subsets Enumeration Tool
Original language description
In many areas of computer science, we are given an unsatisfiable set of constraints with the goal to provide an insight into the unsatisfiability. One of common approaches is to identify minimal unsatisfiable subsets (MUSes) of the constraint set. The more MUSes are identified, the better insight is obtained. However, since there can be up to exponentially many MUSes, their complete enumeration might be intractable. Therefore, we focus on algorithms that enumerate MUSes online, i.e. one by one, and thus can find at least some MUSes even in the intractable cases. Since MUSes find applications in different constraint domains and new applications still arise, there have been proposed several domain agnostic algorithms. Such algorithms can be applied in any constraint domain and thus theoretically serve as ready-to-use solutions for all the emerging applications. However, there are almost no domain agnostic tools, i.e. tools that both implement domain agnostic algorithms and can be easily extended to support any constraint domain. In this work, we close this gap by introducing a domain agnostic tool called MUST. Our tool outperforms other existing domain agnostic tools and moreover, it is even competitive to fully domain specific solutions.
Czech name
—
Czech description
—

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)

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Tools and Algorithms for the Construction and Analysis of Systems
ISBN
9783030451899
ISSN
0302-9743
e-ISSN
1611-3349
Number of pages
18
Pages from-to
135-152
Publisher name
Springer International Publishing
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
—

Similar results(10)