Dempster–Shafer theory

Assign evidential mass to subsets of a frame of discernment, derive belief and plausibility bounds for propositions, and combine appropriately independent evidence with a declared conflict rule.

Version

v2 · 2026-08-30 · History

Domain-specific #

1641

Origin domain

uncertain reasoning

Subdomain

belief functions and evidence fusion

Core Idea

In Dempster–Shafer theory a basic belief assignment \(m:2^{\Theta}\to[0,1]\) places support on subsets of a frame \(\Theta\), usually with \(m(\varnothing)=0\) and \(\sum_A m(A)=1\); \(Bel(A)=\sum_{B\subseteq A}m(B)\) and \(Pl(A)=\sum_{B\cap A\ne\varnothing}m(B)\) bound support for (A). Mass assigned to a nonsingleton focal set records support that does not discriminate among its members; Möbius transforms connect mass, belief and plausibility, while a typed fusion rule intersects focal sets and either exposes, redistributes, or retains conflict according to its assumptions.

Scope of Application

Dempster–Shafer theory applies when the analyst can specify a finite frame of mutually exclusive possibilities and its power set, together with evidence sources represented by basic belief assignments and establish that support is allocated to subsets rather than only singleton outcomes, belief and plausibility are derived consistently from that mass assignment, and any multi-source fusion declares the independence and conflict-normalization semantics it requires. The entry presents a family of related belief-function formalisms, not one universally accepted semantics. Every application must declare its frame, source interpretation, empty-set convention, and combination rule rather than invoking the label as a generic badge of uncertainty handling.

Clarity

A clear claim names the carrier, governing rule, assumptions, and recognition test. This matters because belief, confidence, support, mass and evidence also have ordinary-language and Bayesian meanings, and the wider evidence-theory literature contains competing interpretations and conflict rules. The disciplined statement is that the object counts as Dempster–Shafer theory exactly when support is allocated to subsets rather than only singleton outcomes, belief and plausibility are derived consistently from that mass assignment, and any multi-source fusion declares the independence and conflict-normalization semantics it requires

Manages Complexity

The abstraction compresses Dempster's original multivalued mappings, Shaferian belief functions, normalized and unnormalized conjunctive rules, disjunctive and cautious fusion, transferable-belief interpretations, random-set interpretations, finite and extended frames, and sensor-fusion applications into a stable carrier, rule, invariant, and failure boundary. It makes comparison tractable while retaining the variables that control validity.

Abstract Reasoning

1. Type the carrier. Establish a finite frame of mutually exclusive possibilities and its power set, together with evidence sources represented by basic belief assignments and reject examples from a different problem. 2. Lock the rule. Express that support is allocated to subsets rather than only singleton outcomes, belief and plausibility are derived consistently from that mass assignment, and any multi-source fusion declares the independence and conflict-normalization semantics it requires independently of one notation or implementation.

Knowledge Transfer

Transfer within uncertain reasoning is strong when new cases preserve the same carrier, mechanism, and diagnostic. The move from Two conditionally independent sensors assign mass to overlapping subsets of a finite fault frame; their conjunctive intersections reveal agreement and conflict before a declared Dempster normalization produces the fused belief function to A classifier abstains between several related labels by placing mass on their union, then reports belief and plausibility for a coarser operational category rather than fabricating precise singleton probabilities demonstrates that continuity.

Relationships to Other Abstractions

Current abstraction Dempster–Shafer theory Domain-specific

Parents (1) — more general patterns this builds on

• Dempster–Shafer theory is a kind of Statistical Inference Prime

  The proposed strict upward parent is prime:statistical_inference.

Hierarchy paths (4) — routes to 4 parentless roots

• Dempster–Shafer theory → Statistical Inference → Inductive Reasoning

Show alternative paths (3)

Neighborhood in Abstraction Space

Dempster–Shafer theory sits in a sparse region of the domain-specific corpus (62^nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Imprecise Probability & Multiple Testing (5 abstractions)

Nearest neighbors

• Pignistic probability — 0.89
• Appeal to probability — 0.86
• Point particle — 0.85
• Radical probabilism — 0.85
• Weak n-category — 0.85

Computed from structural-signature embeddings · 2026-09-08