Binary join trees for computing marginals in the Shenoy-Shafer architecture
type: Item
instance of: scholarly article
title: Binary join trees for computing marginals in the Shenoy-Shafer architecture
zbMATH Open document ID: 0939.68021
DOI: 10.1016/S0888-613X(97)89135-9
author: Prakash P. Shenoy
published in: International Journal of Approximate Reasoning
publication date: 1999-12-20T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1381015
zbMATH Keywords: binary joint trees
zbMATH Keywords: Shenoy-Shafer architecture
MaRDI profile type: Publication
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: On the Desirability of Acyclic Database Schemes
cites work: Contribution to nonserial dynamic programming
cites work: Probability functions on complex pedigrees
cites work: An axiomatic framework for propagating uncertainty in directed acyclic networks
cites work: Upper and Lower Probabilities Induced by a Multivalued Mapping
cites work: Uncertain evidence and artificial analysis
cites work: Q3201783
cites work: Q4734791
cites work: Local computation with valuations from a commutative semigroup
cites work: Q3668890
cites work: Fusion, propagation, and structuring in belief networks
cites work: Q5691081
cites work: Propagating belief functions in qualitative Markov trees
cites work: On Spohn's rule for revision of beliefs
cites work: Q3979389
cites work: Conditional independence in valuation-based systems
cites work: REPRESENTING CONDITIONAL INDEPENDENCE RELATIONS BY VALUATION NETWORKS
cites work: Consistency in Valuation-Based Systems
cites work: Q4292466
cites work: Q4295394
description: scientific article; zbMATH DE number 1381015