A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence

zbMath0833.62005MaRDI QIDQ1894228

Paul-André Monney, Jürg Kohlas

Publication date: 18 July 1995

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

zbMATH Keywords

evidencecredibilitystatistical inferencediagnosticsrule-based expert systemsDempster-Shafer theory of evidencedegree of supportdegree of plausibilityprobabilistic assumption-based reasoningtemporal and spatial reasoningtheory of hintsuncertainty in dynamical systems

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Foundations of probability theory (60A99) Artificial intelligence (68T99)

Related Items (38)

Algebraic structure of the families of compatible frames of discernment ⋮ Ordered valuation algebras: A generic framework for approximating inference ⋮ Belief function independence: I. The marginal case ⋮ Algebras of sets and coherent sets of gambles ⋮ A mathematical theory of evidence turns 40 ⋮ Probabilistic argumentation ⋮ A new definition of entropy of belief functions in the Dempster-Shafer theory ⋮ Belief function independence. II: The conditional case. ⋮ Resource bounded and anytime approximation of belief function computations. ⋮ Generic local computation ⋮ Mathematical foundations for a theory of confidence structures ⋮ Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory ⋮ Inference about constrained parameters using the elastic belief method ⋮ On the relative belief transform ⋮ Probabilistic argumentation systems. A new way to combine logic with probability. ⋮ Allocation of arguments and evidence theory ⋮ Generalized Information Theory Based on the Theory of Hints ⋮ Uncertain information: random variables in graded semilattices ⋮ Cost-bounded argumentation ⋮ On the plausibility transformation method for translating belief function models to probability models ⋮ Belief functions combination without the assumption of independence of the information sources ⋮ A belief function classifier based on information provided by noisy and dependent features ⋮ The conjunction fallacy: explanations of the linda problem by the theory of hints ⋮ An algebraic theory for statistical information based on the theory of hints ⋮ Inference in directed evidential networks based on the transferable belief model ⋮ Estimating limits from Poisson counting data using Dempster-Shafer analysis ⋮ Belief decision trees: Theoretical foundations ⋮ Constructing belief functions from sample data using multinomial confidence regions ⋮ A generalization of the algorithm of Heidtmann to non-monotone formulas ⋮ Unnamed Item ⋮ Uncertain Information ⋮ False confidence, non-additive beliefs, and valid statistical inference ⋮ Concepts and methods for discrete and continuous time control under uncertainty ⋮ Using propositional logic to compute probabilities in multistate systems ⋮ Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm ⋮ Model-based diagnostics and probabilistic assumption-based reasoning ⋮ Belief functions and default reasoning ⋮ Belief functions on real numbers

This page was built for publication: A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence