Compiling relational Bayesian networks for exact inference
From MaRDI portal
Publication:2499043
DOI10.1016/j.ijar.2005.10.001zbMath1096.68747MaRDI QIDQ2499043
Manfred Jaeger, Adnan Darwiche, Mark Chavira
Publication date: 14 August 2006
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/2ts2n8nt
68T37: Reasoning under uncertainty in the context of artificial intelligence
Related Items
New Advances in Logic-Based Probabilistic Modeling by PRISM, The Independent Choice Logic and Beyond, SampleSearch: importance sampling in presence of determinism, Mixed deterministic and probabilistic networks, Learning to assign degrees of belief in relational domains, AND/OR branch-and-bound search for combinatorial optimization in graphical models, Memory intensive AND/OR search for combinatorial optimization in graphical models, Probabilistic logic with independence, On probabilistic inference by weighted model counting, Logical Compilation of Bayesian Networks with Discrete Variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A differential semantics for jointree algorithms
- Compiling propositional weighted bases
- On the complexity of inference about probabilistic relational models
- Complex probabilistic modeling with recursive relational Bayesian networks
- A differential approach to inference in Bayesian networks