scientific article; zbMATH DE number 1945067

Publication date: 2 July 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Dempster-Shafer theory of evidence information algebras knowledge presentation

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Knowledge representation (68T30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15)

Related Items (47)

Causal compositional models in valuation-based systems with examples in specific theories ⋮ On a condition for semirings to induce compact information algebras. ⋮ Ordered valuation algebras: A generic framework for approximating inference ⋮ Updating credal networks is approximable in polynomial time ⋮ Algebras of sets and coherent sets of gambles ⋮ Marginalization in models generated by compositional expressions ⋮ Semiring induced valuation algebras: exact and approximate local computation algorithms ⋮ Introduction: Combining probability and logic ⋮ Probabilistic argumentation ⋮ Probabilistic reasoning with graphical security models ⋮ Enabling local computation for partially ordered preferences ⋮ Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks ⋮ An algebraic theory for data linkage ⋮ Fast local search methods for solving limited memory influence diagrams ⋮ Nonlinear desirability theory ⋮ Generic local computation ⋮ Contextuality in distributed systems ⋮ On conditions for semirings to induce compact information algebras ⋮ An axiomatic framework for influence diagram computation with partially ordered preferences ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Logical Compilation of Bayesian Networks with Discrete Variables ⋮ Probabilistic argumentation systems. A new way to combine logic with probability. ⋮ Two Cartesian closed categories of information algebras ⋮ On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras ⋮ Correct audit logging in concurrent systems ⋮ Understanding epistemic relevance ⋮ Generalized Information Theory Based on the Theory of Hints ⋮ Compatibility, desirability, and the running intersection property ⋮ Uncertain information: random variables in graded semilattices ⋮ A belief function classifier based on information provided by noisy and dependent features ⋮ An algebraic theory for statistical information based on the theory of hints ⋮ A logic of soft constraints based on partially ordered preferences ⋮ Information: The Algorithmic Paradigm ⋮ Uncertain Information ⋮ Channels: From Logic to Probability ⋮ One or Many Concepts of Information? ⋮ Sufficient and necessary conditions for solution finding in valuation-based systems ⋮ Local Computation Schemes with Partially Ordered Preferences ⋮ Model-based reliability and diagnostics: A common framework for reliability and diagnostics ⋮ Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited ⋮ Information Algebra ⋮ Information algebras in the theory of imprecise probabilities ⋮ Non-locality, contextuality and valuation algebras: a general theory of disagreement ⋮ Probability envelopes and their Dempster-Shafer approximations in statistical matching ⋮ Information algebras in the theory of imprecise probabilities, an extension ⋮ Belief functions on real numbers ⋮ Compositional models in valuation-based systems

This page was built for publication: