Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks

Solomon E. Shimony, Carmel Domshlak

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


Directed-path (DP) singly-connected Bayesian networks are an interesting special case that, in particular, includes both polytrees and two-level networks. We analyze the computational complexity of these networks. The prediction problem is shown to be easy, as standard message passing can perform correct updating. However, diagnostic reasoning is hard even for DP singly-connected networks. In addition, finding the most-probable explanation (MPE) is hard, even without evidence. Finally, complexity of nearly DP singly-connected networks is analyzed.

Original languageEnglish
Pages (from-to)213-225
Number of pages13
JournalArtificial Intelligence
Issue number1-2
StatePublished - 1 Dec 2003


  • Bayes networks
  • Complexity
  • Probabilistic reasoning
  • Singly-connected DAGs

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence


Dive into the research topics of 'Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks'. Together they form a unique fingerprint.

Cite this