Načítá se...
MUST: Minimal Unsatisfiable Subsets Enumeration Tool
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...
Uloženo v:
| Vydáno v: | Tools and Algorithms for the Construction and Analysis of Systems |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2020
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7439739/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45190-5_8 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|