Hashing-based approximate counting of minimal unsatisfiable subsets

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On computing minimal independent support and its applications to sampling and counting
Fast, flexible MUS enumeration
Analysing sanity of requirements for avionics systems
Counting minimal unsatisfiable subsets
Solving satisfiability in less than $2^ n$ steps
Diagnosing multiple faults
A theory of diagnosis from first principles
Ein Satz über Untermengen einer endlichen Menge.
PySAT: a Python toolkit for prototyping with SAT oracles
Investigations on autark assignments
The complexity of selecting maximal solutions
Not all FPRASs are equal: demystifying FPRASs for DNF-counting
QRATPre+: effective QBF preprocessing via strong redundancy properties
On computing the union of MUSes
Approximate counting of minimal unsatisfiable subsets
Algorithms for computing minimal unsatisfiable subsets of constraints
Finding a Collection of MUSes Incrementally
BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies
On Improving MUS Extraction Algorithms
MUS Extraction Using Clausal Proofs
Computing Maximal Autarkies with Few and Simple Oracle Queries
Enumerating Infeasibility: Finding Multiple MUSes Quickly
Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
Sparse Hashing for Scalable Approximate Model Counting
Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets
Formulas Free From Inconsistency: An Atom-Centric Characterization in Priest's Minimally Inconsistent LP
Online Enumeration of All Minimal Inductive Validity Cores
Understanding and extending incremental determinization for 2QBF
Recursive online enumeration of all minimal unsatisfiable subsets

This page was built for publication: Hashing-based approximate counting of minimal unsatisfiable subsets