Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence

Carmel Domshlak, Solomon E. Shimony

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


Prior work has shown that context-specific independence (CSI) in Bayes networks can be exploited to speed up belief updating. We examine how networks with variables exhibiting mutual exclusion (e.g., "selector variables"), as well as CSI, can be efficiently updated. In particular, directed-path singly connected and polytree networks that have an additional common selector variable can be updated in linear time (given null and general conjunctive evidence, respectively), where quadratic time would be needed without the mutual exclusion requirement. The above results have direct applications, as such network topologies can be used in predicting the ramifications of user selection in some multimedia data browsing systems.

Original languageEnglish
Pages (from-to)703-725
Number of pages23
JournalInternational Journal of Intelligent Systems
Issue number8
StatePublished - 1 Aug 2004

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Human-Computer Interaction
  • Artificial Intelligence


Dive into the research topics of 'Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence'. Together they form a unique fingerprint.

Cite this