Cargando…
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...
Autores principales: | Bendík, Jaroslav, Černá, Ivana |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7439739/ http://dx.doi.org/10.1007/978-3-030-45190-5_8 |
Ejemplares similares
-
Approximate Counting of Minimal Unsatisfiable Subsets
por: Bendík, Jaroslav, et al.
Publicado: (2020) -
Unsatisfied
Publicado: (1890) -
The entropy principle: thermodynamics for the unsatisfied
por: Thess, André, et al.
Publicado: (2011) -
Abstract 2. Salvage Ear Reconstruction of the Unsatisfied Patient
por: Reinisch, John, et al.
Publicado: (2017) -
Timed Automata Relaxation for Reachability
por: Bendík, Jaroslav, et al.
Publicado: (2021)