Compiling relational Bayesian networks for exact inference
From MaRDI portal
Publication:2499043
Recommendations
- Modeling and Reasoning with Bayesian Networks
- The effect of combination functions on the complexity of relational Bayesian networks
- Complex probabilistic modeling with recursive relational Bayesian networks
- The complexity of Bayesian networks specified by propositional and relational languages
- On the complexity of inference about probabilistic relational models
Cites work
- A differential approach to inference in Bayesian networks
- A differential semantics for jointree algorithms
- Compiling propositional weighted bases
- Complex probabilistic modeling with recursive relational Bayesian networks
- scientific article; zbMATH DE number 4178809 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 1875393 (Why is no real title available?)
- scientific article; zbMATH DE number 4189233 (Why is no real title available?)
- On the complexity of inference about probabilistic relational models
Cited in
(27)- 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
- A compositional approach to probabilistic knowledge compilation
- Weighted model counting without parameter variables
- Complex probabilistic modeling with recursive relational Bayesian networks
- Probabilistic logic with independence
- On probabilistic inference by weighted model counting
- Algebraic model counting
- The effect of combination functions on the complexity of relational Bayesian networks
- Exploiting local and repeated structure in dynamic Bayesian networks
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Logical Compilation of Bayesian Networks with Discrete Variables
- scientific article; zbMATH DE number 1149441 (Why is no real title available?)
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- scientific article; zbMATH DE number 1392295 (Why is no real title available?)
- A generic framework for a compilation-based inference in probabilistic and possibilistic networks
- SampleSearch: importance sampling in presence of determinism
- New Advances in Logic-Based Probabilistic Modeling by PRISM
- The Independent Choice Logic and Beyond
- scientific article; zbMATH DE number 2243411 (Why is no real title available?)
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
- An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL
- PRM inference using Jaffray \& Faÿ's local conditioning
- Towards an effective practice of learning from data and knowledge
- Belief graphical models for uncertainty representation and reasoning
- Mixed deterministic and probabilistic networks
This page was built for publication: Compiling relational Bayesian networks for exact inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2499043)
