Rounding meets approximate model counting

DOI10.1007/978-3-031-37703-7_7MaRDI QIDQ6535531zbMATH OpenFDO

Authors Jiong Yang, Kuldeep S. Meel

Publication date 12 January 2024

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational aspects of satisfiability (68R07)

Recommendations

• A new probabilistic algorithm for approximate model counting
• Two approximate algorithms for model counting
• On hashing-based approaches to approximate DNF-counting
• Fast and flexible probabilistic model counting
• Model counting: a new stategy for obtaining good bounds

Cites work

• Model counting: a new stategy for obtaining good bounds
• On computing minimal independent support and its applications to sampling and counting
• On the hardness of approximate reasoning
• Optimal orientations of cells in slicing floorplan designs
• Projected model counting: beyond independent support
• Quantifying software reliability via model-counting
• Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
• Sparse Hashing for Scalable Approximate Model Counting
• The Complexity of Enumeration and Reliability Problems
• Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
• Treewidth and counting projected answer sets
• Universal classes of hash functions

Cited in

(1)

• Approximate Model Counting, Sparse XOR Constraints and Minimum Distance

This page was built for publication: Rounding meets approximate model counting

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