Binary join trees for computing marginals in the Shenoy-Shafer architecture
- 1 August 1997
- journal article
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 17 (2-3) , 239-263
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An axiomatic framework for propagating uncertainty in directed acyclic networksInternational Journal of Approximate Reasoning, 1993
- On Spohn's rule for revision of beliefsInternational Journal of Approximate Reasoning, 1991
- A valuation-based language for expert systemsInternational Journal of Approximate Reasoning, 1989
- Uncertain evidence and artificial analysisJournal of Statistical Planning and Inference, 1988
- Propagating belief functions in qualitative Markov treesInternational Journal of Approximate Reasoning, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Fusion, propagation, and structuring in belief networksArtificial Intelligence, 1986
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Probability functions on complex pedigreesAdvances in Applied Probability, 1978
- Upper and Lower Probabilities Induced by a Multivalued MappingThe Annals of Mathematical Statistics, 1967