A compositional approach to probabilistic knowledge compilation
From MaRDI portal
Publication:2060758
DOI10.1016/j.ijar.2021.07.007zbMath1478.68371OpenAlexW3188203909MaRDI QIDQ2060758
Giso H. Dal, Arjen Hommersom, Peter J. F. Lucas, Alfons W. Laarman
Publication date: 13 December 2021
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2021.07.007
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Probabilistic graphical models (62H22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Weighted positive binary decision diagrams for exact probabilistic inference
- Probabilistic sentence satisfiability: an approach to PSAT
- On the relative expressiveness of Bayesian and neural networks
- Advanced SMT techniques for weighted model integration
- Factoring Boolean functions using graph partitioning
- On probabilistic inference by weighted model counting
- A work-efficient distributed algorithm for reachability analysis
- Compiling relational Bayesian networks for exact inference
- Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
- Graph-Based Algorithms for Boolean Function Manipulation
- Probabilistic Networks and Expert Systems
- Improving the variable ordering of OBDDs is NP-complete
- Exact Model Counting of Query Expressions
- Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams
- Formal Methods in Computer-Aided Design
- PROBABILISTIC DECISION GRAPHS — COMBINING VERIFICATION AND AI TECHNIQUES FOR PROBABILISTIC INFERENCE
- Recursive conditioning
This page was built for publication: A compositional approach to probabilistic knowledge compilation