A New Approach to Partial MUS Enumeration

Autor:	Michael Kaufmann, Christian Zielke
Rok vydání:	2015
Předmět:	Boolean domain Constraint (information theory) Discrete mathematics Enumeration Conjunctive normal form Conjunctive normal form formula Time limit Mathematics
Zdroj:	Lecture Notes in Computer Science ISBN: 9783319243177 SAT
DOI:	10.1007/978-3-319-24318-4_28
Popis:	Searching for minimal explanations of infeasibility in constraint sets is a problem known for many years. Recent developments closed a gap between approaches that enumerate all minimal unsatisfiable subsets (MUSes) of an unsatisfiable formula in the Boolean domain and approaches that extract only one single MUS. These new algorithms are described as partial MUS enumerators. They offer a viable option when complete enumeration is not possible within a certain time limit.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2a1167cc244bb2a15dd7a4e4ae54e96a https://doi.org/10.1007/978-3-319-24318-4_28 Zobrazit plný text záznamu