Counting minimal unsatisfiable subsets
type: Item
instance of: scholarly article
title: Counting minimal unsatisfiable subsets
zbMATH Open document ID: 1493.68259
DOI: 10.1007/978-3-030-81688-9_15
author: Jaroslav Bendík
author: Kuldeep S. Meel
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 68R07
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 7498186
describes a project that uses: sharpSAT
describes a project that uses: GANAK
describes a project that uses: BEACON
describes a project that uses: CEGAR
describes a project that uses: AMUSE
describes a project that uses: MUSer2
MaRDI profile type: Publication
full work available at URL: 978-3-030-81688-9 15
OpenAlex ID: W3184610995
cites work: BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies
cites work: Finding a Collection of MUSes Incrementally
cites work: MUS Extraction Using Clausal Proofs
cites work: Q3194802
cites work: Q4636600
cites work: Recursive online enumeration of all minimal unsatisfiable subsets
cites work: Approximate counting of minimal unsatisfiable subsets
cites work: The complexity of selecting maximal solutions
cites work: Subtractive reductions and complete problems for counting complexity classes
cites work: Quantified maximum satisfiability
cites work: On computing minimal independent support and its applications to sampling and counting
cites work: Diagnosing multiple faults
cites work: Investigations on autark assignments
cites work: Constraint satisfaction problems in clausal form. II: Minimal unsatisfiability and conflict structure
cites work: Computing Maximal Autarkies with Few and Simple Oracle Queries
cites work: Redundancy in logic. I: CNF propositional formulae
cites work: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
cites work: Fast, flexible MUS enumeration
cites work: Algorithms for computing minimal unsatisfiable subsets of constraints
cites work: On the query complexity of selecting minimal sets for monotone predicates
cites work: On computing the union of MUSes
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: Formulas Free From Inconsistency: An Atom-Centric Characterization in Priest's Minimally Inconsistent LP
cites work: Measuring the blame of each formula for inconsistent prioritized knowledge bases
cites work: Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
cites work: A theory of diagnosis from first principles
cites work: Q5226731
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Q3455621
description: scientific article; zbMATH DE number 7498186