Hashing-based approximate counting of minimal unsatisfiable subsets
type: Item
instance of: scholarly article
title: Hashing-based approximate counting of minimal unsatisfiable subsets
author: Jaroslav Bendík
author: Kuldeep S. Meel
published in: Formal Methods in System Design
publication date: 2024-11-04T00:00:00Z
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7938227
zbMATH Keywords: minimal unsatisfiable subsets
zbMATH Keywords: MUS
zbMATH Keywords: counting
zbMATH Keywords: infeasibility analysis
zbMATH Keywords: diagnosis
MaRDI profile type: Publication
cites work: Formulas Free From Inconsistency: An Atom-Centric Characterization in Priest's Minimally Inconsistent LP
cites work: BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies
cites work: On computing minimal independent support and its applications to sampling and counting
cites work: Q5226731
cites work: Enumerating Infeasibility: Finding Multiple MUSes Quickly
cites work: Finding a Collection of MUSes Incrementally
cites work: Recursive online enumeration of all minimal unsatisfiable subsets
cites work: Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets
cites work: Approximate counting of minimal unsatisfiable subsets
cites work: Sparse Hashing for Scalable Approximate Model Counting
cites work: The complexity of selecting maximal solutions
cites work: Q5503674
cites work: Ein Satz über Untermengen einer endlichen Menge.
cites work: Diagnosing multiple faults
cites work: A theory of diagnosis from first principles
cites work: Algorithms for computing minimal unsatisfiable subsets of constraints
cites work: On computing the union of MUSes
cites work: Fast, flexible MUS enumeration
cites work: Q4636600
cites work: Counting minimal unsatisfiable subsets
cites work: Q3194802
cites work: MUS Extraction Using Clausal Proofs
cites work: Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: Investigations on autark assignments
cites work: Computing Maximal Autarkies with Few and Simple Oracle Queries
cites work: On Improving MUS Extraction Algorithms
cites work: Understanding and extending incremental determinization for 2QBF
cites work: QRATPre+: effective QBF preprocessing via strong redundancy properties
cites work: PySAT: a Python toolkit for prototyping with SAT oracles
cites work: Not all FPRASs are equal: demystifying FPRASs for DNF-counting
cites work: Analysing sanity of requirements for avionics systems
cites work: Online Enumeration of All Minimal Inductive Validity Cores
DOI: 10.1007/S10703-023-00419-W
description: scientific article; zbMATH DE number 7938227