Approximate counting of minimal unsatisfiable subsets

DOI10.1007/978-3-030-53288-8_21zbMath1478.68199OpenAlexW3043371138MaRDI QIDQ2225120

Jaroslav Bendík, Kuldeep S. Meel

Publication date: 4 February 2021

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)

Related Items (2)

Counting minimal unsatisfiable subsets ⋮ Accelerating predicate abstraction by minimum unsatisfiable cores extraction

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