A new probabilistic algorithm for approximate model counting

DOI10.1007/978-3-319-94205-6_21MaRDI QIDQ1799093zbMATH OpenOpenAlexFDO

Authors Cunjing Ge, Feifei Ma, Tian Liu, Jian Zhang, Xutong Ma

Publication date 18 October 2018

Full work available at URL https://arxiv.org/abs/1706.03906

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Theory and Applications of Satisfiability Testing
• 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

Cited in

(13)

• Fast and flexible probabilistic model counting
• Probabilistic model counting with short XORs
• New width parameters for model counting
• Approximate counting in SMT and value estimation for probabilistic programs
• ProCount: weighted projected model counting with graded project-join trees
• Model counting for recursively-defined strings
• Approximate model counting via extension rule
• Two approximate algorithms for model counting
• On hashing-based approaches to approximate DNF-counting
• Leveraging belief propagation, backtrack search, and statistics for model counting
• Theory and Applications of Satisfiability Testing
• Model counting meets \(F_0\) estimation
• Rounding meets approximate model counting

Describes a project that uses

Uses Software

• Boolector

This page was built for publication: A new probabilistic algorithm for approximate model counting

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