Resource bounded and anytime approximation of belief function computations.
type: Item
instance of: scholarly article
title: Resource bounded and anytime approximation of belief function computations.
zbMATH Open document ID: 1033.68116
DOI: 10.1016/S0888-613X(02)00074-9
author: R. Haenni
author: N. Lehmann
published in: International Journal of Approximate Reasoning
publication date: 2003-07-30T00:00:00Z
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 1956981
zbMATH Keywords: Belief functions
zbMATH Keywords: Dempster-Shafer theory
zbMATH Keywords: incompleteness
zbMATH Keywords: lower and upper approximation
zbMATH Keywords: join tree propagation
zbMATH Keywords: fusion algorithm
zbMATH Keywords: interruptible anytime algorithm
MaRDI profile type: Publication
cites work: Upper and Lower Probabilities Induced by a Multivalued Mapping
cites work: Q4131415
cites work: A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
cites work: The transferable belief model
cites work: Probabilistic argumentation systems
cites work: Probabilistic argumentation systems: a new perspective on the dempster-shafer theory
cites work: Dempster's rule of combination is {\#}P-complete
cites work: Symbolic and quantitative approaches to reasoning and uncertainty. European conference, ECSQARU `99. London, GB, July 5-9, 1999. Proceedings
cites work: A computationally efficient approximation of Dempster-Shafer theory
cites work: Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
cites work: Consonant approximations of belief functions
cites work: INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH
cites work: Binary join trees for computing marginals in the Shenoy-Shafer architecture
cites work: Uncertain evidence and artificial analysis
cites work: Q3994497
cites work: Implementing belief function computations
cites work: Q4292466
cites work: Computation in valuation algebras
cites work: Bucket elimination: A unifying framework for reasoning
cites work: Propositional information systems
cites work: Q3201783
cites work: Q4734791
cites work: Propagating belief functions in qualitative Markov trees
cites work: Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals
cites work: Q3765523
description: scientific article; zbMATH DE number 1956981