On the complexity of belief network synthesis and refinement
type: Item
instance of: scholarly article
title: On the complexity of belief network synthesis and refinement
zbMATH Open document ID: 0769.68114
DOI: 10.1016/0888-613X(92)90007-M
author: Marco Valtorta
author: Donald W. Loveland
published in: International Journal of Approximate Reasoning
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68T35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 165630
zbMATH Keywords: knowledge base refinement
zbMATH Keywords: expert systems
zbMATH Keywords: knowledge acquisition
zbMATH Keywords: belief nets
zbMATH Keywords: Dempster-Shafer theory of evidence
zbMATH Keywords: NP-completeness
zbMATH Keywords: Dempster- Shafer networks
zbMATH Keywords: Bayesian networks
zbMATH Keywords: synthesis
MaRDI profile type: Publication
cites work: Belief functions and default reasoning
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Propagating belief functions in qualitative Markov trees
cites work: A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
cites work: Q4198056
cites work: Q4734791
cites work: Bayesian and non-Bayesian evidential updating
cites work: Q3964033
cites work: Dempster's rule of combination is {\#}P-complete
cites work: A logic-based analysis of Dempster-Shafer theory
cites work: Q4013532
cites work: Adapting connectionist learning to Bayes networks
full work available at URL: 0888-613x(92)90007-m
OpenAlex ID: W2094281172
description: scientific article; zbMATH DE number 165630