Counting minimal unsatisfiable subsets
From MaRDI portal
Publication:832272
DOI10.1007/978-3-030-81688-9_15zbMATH Open1493.68259OpenAlexW3184610995MaRDI QIDQ832272FDOQ832272
Jaroslav Bendík, Kuldeep S. Meel
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81688-9_15
Recommendations
Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computational aspects of satisfiability (68R07)
Cites Work
- Title not available (Why is that?)
- The complexity of selecting maximal solutions
- Algorithms for computing minimal unsatisfiable subsets of constraints
- On the query complexity of selecting minimal sets for monotone predicates
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Redundancy in logic. I: CNF propositional formulae
- On computing minimal independent support and its applications to sampling and counting
- The Complexity of Enumeration and Reliability Problems
- Diagnosing multiple faults
- A theory of diagnosis from first principles
- Fast, flexible MUS enumeration
- Quantified maximum satisfiability
- Constraint satisfaction problems in clausal form. II: Minimal unsatisfiability and conflict structure
- Title not available (Why is that?)
- Subtractive reductions and complete problems for counting complexity classes
- Solving satisfiability in less than \(2^ n\) steps
- Measuring the blame of each formula for inconsistent prioritized knowledge bases
- Investigations on autark assignments
- On computing the union of MUSes
- Approximate counting of minimal unsatisfiable subsets
- Finding a Collection of MUSes Incrementally
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies
- MUS Extraction Using Clausal Proofs
- Computing Maximal Autarkies with Few and Simple Oracle Queries
- Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
- Formulas Free From Inconsistency: An Atom-Centric Characterization in Priest's Minimally Inconsistent LP
- Recursive online enumeration of all minimal unsatisfiable subsets
Cited In (6)
- Calculating the minimal number of homogeneous objects to represent a plurality in a heterogeneous system of objects
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Hashing-based approximate counting of minimal unsatisfiable subsets
- Boolean abstractions for realizability modulo theories
- Minimal enumerations of subsets of a finite set and the middle level problem
- Computing MUS-based inconsistency measures
Uses Software
This page was built for publication: Counting minimal unsatisfiable subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832272)
