Approximate counting of minimal unsatisfiable subsets

DOI10.1007/978-3-030-53288-8_21MaRDI QIDQ2225120zbMATH OpenOpenAlexFDO

Authors Jaroslav Bendík, Kuldeep S. Meel

Publication date 4 February 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-53288-8_21

Mathematics Subject Classification ID

Logic in computer science (03B70) Computational aspects of satisfiability (68R07)

Recommendations

• Counting minimal unsatisfiable subsets
• Finding Guaranteed MUSes Fast
• Fast, flexible MUS enumeration
• Local-search extraction of mUSes
• On computing the union of MUSes

Cited in

(5)

• Accelerating predicate abstraction by minimum unsatisfiable cores extraction
• Computing MUS-based inconsistency measures
• Preface of the special issue on the conference on computer-aided verification 2020 and 2021
• Hashing-based approximate counting of minimal unsatisfiable subsets
• Counting minimal unsatisfiable subsets

This page was built for publication: Approximate counting of minimal unsatisfiable subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225120)