Weighted positive binary decision diagrams for exact probabilistic inference

DOI10.1016/j.ijar.2017.08.003zbMath1419.68092arXiv1610.05551OpenAlexW2534147422MaRDI QIDQ1678452

Giso H. Dal, Peter J. F. Lucas

Publication date: 17 November 2017

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.05551

zbMATH Keywords

Bayesian networksprobabilistic inferencebinary decision diagramsknowledge compilationweighted model counting

Mathematics Subject Classification ID

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

Related Items

Exact stochastic constraint optimisation with applications in network analysis ⋮ A compositional approach to probabilistic knowledge compilation

Uses Software

• CUDD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An analysis of first-order logics of probability
• Probabilistic logic
• On probabilistic inference by weighted model counting
• Counting truth assignments of formulas of bounded tree-width or clique-width
• The Log-Support Encoding of CSP into SAT
• Logical Compilation of Bayesian Networks with Discrete Variables
• Graph-Based Algorithms for Boolean Function Manipulation
• Improving the variable ordering of OBDDs is NP-complete
• Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams
• Decomposable negation normal form
• PROBABILISTIC DECISION GRAPHS — COMBINING VERIFICATION AND AI TECHNIQUES FOR PROBABILISTIC INFERENCE
• Principles and Practice of Constraint Programming – CP 2003