Fast and flexible probabilistic model counting

DOI10.1007/978-3-319-94144-8_10MaRDI QIDQ1656574zbMATH OpenOpenAlexFDO

Authors Zayd S. Hammoudeh, Panos Theodoropoulos, D. Achlioptas

Publication date 10 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94144-8_10

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic model counting with short XORs
• Model counting with error-correcting codes
• Model counting: a new stategy for obtaining good bounds
• A new probabilistic algorithm for approximate model counting
• Two approximate algorithms for model counting

Cited in

(16)

• Probabilistic model counting with short XORs
• New width parameters for model counting
• Approximate counting in SMT and value estimation for probabilistic programs
• A new probabilistic algorithm for approximate model counting
• Model counting with error-correcting codes
• ProCount: weighted projected model counting with graded project-join trees
• Definability for model counting
• Laissez-faire caching for parallel \#SAT solving
• Short XORs for Model Counting: From Theory to Practice
• Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
• Leveraging belief propagation, backtrack search, and statistics for model counting
• Theory and Applications of Satisfiability Testing
• Model counting: a new stategy for obtaining good bounds
• Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
• Model counting meets \(F_0\) estimation
• Rounding meets approximate model counting

This page was built for publication: Fast and flexible probabilistic model counting

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