Anytime Weighted Model Counting with Approximation Guarantees for Probabilistic Inference.
Alexandre DubrayPierre SchausSiegfried NijssenPublished in: CP (2024)
Keyphrases
- weighted model counting
- probabilistic inference
- approximation guarantees
- greedy algorithm
- approximation algorithms
- graphical models
- np hard
- lower bound
- bayesian networks
- objective function
- conditional probabilities
- message passing
- approximate inference
- belief networks
- exact inference
- bayesian inference
- model counting
- worst case
- probabilistic model
- special case
- dynamic programming
- branch and bound
- belief propagation