On the complexity of belief network synthesis and refinement
DOI10.1016/0888-613X(92)90007-MzbMATH Open0769.68114OpenAlexW2094281172MaRDI QIDQ1207964FDOQ1207964
Authors: Marco Valtorta, Donald W. Loveland
Publication date: 16 May 1993
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0888-613x(92)90007-m
Recommendations
Bayesian networkssynthesisNP-completenessknowledge acquisitionexpert systemsDempster-Shafer theory of evidenceknowledge base refinementbelief netsDempster- Shafer networks
Analysis of algorithms and problem complexity (68Q25) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Propagating belief functions in qualitative Markov trees
- A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
- The computational complexity of probabilistic inference using Bayesian belief networks
- Bayesian and non-Bayesian evidential updating
- Belief functions and default reasoning
- A logic-based analysis of Dempster-Shafer theory
- Title not available (Why is that?)
- Dempster's rule of combination is {\#}P-complete
- Adapting connectionist learning to Bayes networks
- Title not available (Why is that?)
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)