On the complexity of belief network synthesis and refinement
From MaRDI portal
(Redirected from Publication:1207964)
Recommendations
Cites work
- scientific article; zbMATH DE number 3786157 (Why is no real title available?)
- scientific article; zbMATH DE number 67614 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- A logic-based analysis of Dempster-Shafer theory
- A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
- Adapting connectionist learning to Bayes networks
- Bayesian and non-Bayesian evidential updating
- Belief functions and default reasoning
- Dempster's rule of combination is {\#}P-complete
- Propagating belief functions in qualitative Markov trees
- The computational complexity of probabilistic inference using Bayesian belief networks
Cited in
(3)
This page was built for publication: On the complexity of belief network synthesis and refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207964)