Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls.
Supratik ChakrabortyKuldeep S. MeelMoshe Y. VardiPublished in: IJCAI (2016)
Keyphrases
- probabilistic inference
- weighted model counting
- model counting
- graphical models
- bayesian networks
- message passing
- influence diagrams
- junction tree
- bayesian belief networks
- belief networks
- approximate inference
- context specific independence
- conditional probabilities
- elimination algorithm
- satisfiability problem
- sat problem
- knowledge compilation
- polynomial size
- artificial neural networks
- phase transition
- search algorithm
- decision trees