Cargando…
Approximate Counting of Minimal Unsatisfiable Subsets
Given an unsatisfiable formula F in CNF, i.e. a set of clauses, the problem of Minimal Unsatisfiable Subset (MUS) seeks to identify a minimal subset of clauses [Formula: see text] such that N is unsatisfiable. The emerging viewpoint of MUSes as the root causes of unsatisfiability has led MUSes to fi...
Autores principales: | Bendík, Jaroslav, Meel, Kuldeep S. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7363222/ http://dx.doi.org/10.1007/978-3-030-53288-8_21 |
Ejemplares similares
-
MUST: Minimal Unsatisfiable Subsets Enumeration Tool
por: Bendík, Jaroslav, et al.
Publicado: (2020) -
On the Sparsity of XORs in Approximate Model Counting
por: Agrawal, Durgesh, 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)