Two approximate algorithms for model counting
DOI10.1016/J.TCS.2016.04.047zbMATH Open1356.68110OpenAlexW2413589572MaRDI QIDQ507433FDOQ507433
Authors: Jinyan Wang, Minghao Yin, Jingli Wu 
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.047
Recommendations
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)
Cites Work
- Title not available (Why is that?)
- Random generation of combinatorial structures from a uniform distribution
- Probabilistic planning via heuristic forward search and weighted model counting
- A machine program for theorem-proving
- Solving \#SAT and Bayesian inference with backtracking search
- Approximate inclusion-exclusion
- Theory and Applications of Satisfiability Testing
- Planning as satisfiability: heuristics
- Title not available (Why is that?)
- Inclusion-exclusion: exact and approximate
- Theorem proving based on the extension rule
- Towards a theory of random walk planning: regress factors, fair homogeneous graphs and extensions
- Exploiting structure in weighted model counting approaches to probabilistic inference
- Solving \#SAT using extension rules
- CNF-Satisfiability Test by Counting and Polynomial Average Time
- Leveraging belief propagation, backtrack search, and statistics for model counting
Cited In (18)
- Solving \#SAT using extension rules
- On hashing-based approaches to approximate DNF-counting
- Fast and flexible probabilistic model counting
- A new probabilistic algorithm for approximate model counting
- Counting propositional models
- Algorithms for propositional model counting
- New width parameters for model counting
- Approximate counting in SMT and value estimation for probabilistic programs
- Theory and Applications of Satisfiability Testing
- Approximate model counting via extension rule
- An exhaustive DPLL algorithm for model counting
- Algorithms for Propositional Model Counting
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- Model counting of monotone conjunctive normal form formulas with spectra
- Counting Models in Integer Domains
- Theory and Applications of Satisfiability Testing
- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
- A study of symmetry breaking predicates and model counting
Uses Software
This page was built for publication: Two approximate algorithms for model counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507433)
