The computational complexity of probabilistic inference using bayesian belief networks

1990/03/01 by Gregory F. Cooper · 11 citations
Computer Science · #AI-based Problem Solving and Planning #Algorithm #Approximate inference #Artificial intelligence #Bayesian Modeling and Causal Inference #Bayesian inference #Bayesian network #Bayesian probability #Belief propagation #Computer science #Inference #Knowledge representation and reasoning #Machine Learning and Algorithms #Machine learning #Probabilistic logic #Probabilistic logic network #Theoretical computer science

paper · doi:10.1016/0004-3702(90)90060-d

crossref issued 1990/03/01 · crossref published 1990/03/01 · crossref published-print 1990/03/01 · openalex publication_date 1990/03/01 · crossref created 2003/03/14 · crossref deposited 2025/09/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/13 · crossref indexed 2026/07/31

Citations

• The complexity of theorem-proving procedures
• Fusion, propagation, and structuring in belief networks

Cited by

• Measuring the Hardness of Stochastic Sampling on Bayesian Networks with Deterministic Causalities: the k-Test
• Bayesian Networks for Data Mining
• An optimal approximation algorithm for Bayesian inference
• A Structurally and Temporally Extended Bayesian Belief Network Model: Definitions, Properties, and Modeling Techniques
• Variational hybridization and transformation for large inaccurate noisy-or networks
• Evaluation of Bayesian networks with flexible state-space abstraction methods
• Variational Probabilistic Inference and the QMR-DT Network
• On the phylogeny graphs of degree-bounded digraphs
• The phylogeny number in the aspect of triangles and diamonds of a graph
• A survey of research in deliberative real-time artificial intelligence
• Bayesian network [wikipedia]