Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
type: Item
instance of: scholarly article
title: Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
zbMATH Open document ID: 1082.68837
DOI: 10.1016/S0004-3702(03)00110-3
author: Carmel Domshlak
author: Solomon E. Shimony
published in: Artificial Intelligence
publication date: 2006-02-07T00:00:00Z
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 5003925
zbMATH Keywords: Probabilistic reasoning
zbMATH Keywords: Bayes networks
zbMATH Keywords: Complexity
zbMATH Keywords: Singly-connected DAGs
MaRDI profile type: Publication
Wikidata QID: Q57518782
cites work: Approximating MAPs for belief networks is NP-hard and other theorems
cites work: Q5501802
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Q3619797
cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard
cites work: Recursive conditioning
cites work: Local conditioning in Bayesian networks
cites work: Q4411159
cites work: Q4198056
cites work: An algebra of bayesian belief universes for knowledge‐based systems
cites work: An \(O(|V|^2)\) algorithm for single connectedness
cites work: Q4734791
cites work: A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference
cites work: Probabilistic Horn abduction and Bayesian networks
cites work: Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks
cites work: On the hardness of approximate reasoning
cites work: Finding MAPs for belief networks is NP-hard
cites work: NP is as easy as detecting unique solutions
full work available at URL: s0004-3702(03)00110-3
OpenAlex ID: W2029891923
DBLP publication ID: journals/ai/ShimonyD03
description: scientific article; zbMATH DE number 5003925