Solving \#SAT and Bayesian inference with backtracking search
From MaRDI portal
Solving \SAT and Bayesian inference with backtracking search
Recommendations
- scientific article; zbMATH DE number 2096817
- Exploiting structure in weighted model counting approaches to probabilistic inference
- An overview of backtrack search satisfiability algorithms
- Bayes networks for estimating the number of solutions of constraint networks
- Leveraging belief propagation, backtrack search, and statistics for model counting
Cited in
(25)- ProCount: weighted projected model counting with graded project-join trees
- Handling epistemic and aleatory uncertainties in probabilistic circuits
- Semiring programming: a semantic framework for generalized sum product problems
- New width parameters for SAT and \#SAT
- Algorithms for propositional model counting
- Sum-product graphical models
- Advanced SMT techniques for weighted model integration
- On probabilistic inference by weighted model counting
- Algebraic model counting
- The state of SAT
- Time-space trade-offs in resolution: superpolynomial lower bounds for superlinear space
- Exploiting structure in weighted model counting approaches to probabilistic inference
- Model counting for CNF formulas of bounded modular treewidth
- Approximate model counting via extension rule
- \(\#{\exists}\mathrm{SAT}\): projected model counting
- Community structure inspired algorithms for SAT and \#SAT
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- Two approximate algorithms for model counting
- Sum-of-Products with Default Values: Algorithms and Complexity Results
- Leveraging belief propagation, backtrack search, and statistics for model counting
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
- Semiring reasoning frameworks in AI and their computational complexity
- Enhancing SMT-based weighted model integration by structure awareness
- New perspectives on semiring applications to dynamic programming
- Mixed deterministic and probabilistic networks
This page was built for publication: Solving \#SAT and Bayesian inference with backtracking search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624187)
