Spohn's Ranking Functions (OCFs)

• Spohn’s Ranking Functions are ordinal conditional functions that assign nonnegative integers to possible worlds to represent degrees of disbelief or surprise.
• They underpin deductively closed belief formation, conditional acceptance, and iterative revision, with explicit links to possibility and probability measures.
• RankPL operationalizes these functions in a programming language, using constructs like ranked choice and observation to update epistemic states efficiently.

Spohn’s ranking functions, also called ordinal conditional functions (OCFs), are epistemic-state representations that assign ordinal degrees of disbelief, implausibility, or surprise to possible worlds and extend those values to propositions by minimization over their supporting worlds. In the finite settings emphasized in formal, comparative, and computational work, they serve as a calculus for plausibility ordering, deductively closed belief, conditional acceptance, conditioning, iterated revision, and forgetting. They also admit explicit translations into possibility measures and principled, though non-invertible, transformations to and from probability measures (1304.1118, Rienstra, 2017, Beierle et al., 29 Aug 2025, Giang et al., 2013).

1. Formal structure and semantic interpretation

In finite presentations, a ranking function assigns nonnegative integers to worlds, sometimes with an added value $\infty$ for impossibility. RankPL defines a ranking function as

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$

with

$$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$

for nonempty events $A$, and the normalization condition

$\kappa(\Omega)=0.$

The 2025 forgetting framework presents OCFs as

$\kappa:\Omega\to\mathbb{N}$

with $\kappa^{-1}(0)\neq\emptyset$, which is the same normalization requirement in equivalent form: at least one world is maximally plausible (Rienstra, 2017, Beierle et al., 29 Aug 2025).

Dubois and Prade use a finite Boolean algebra $B$ induced by a partition $\{A_1,\dots,A_m\}$ of $\Omega$, and impose three structural conditions: constancy of $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$0 on each cell $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$1, existence of at least one cell with rank $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$2, and event evaluation by

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$3

In that formulation, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$4 is interpreted as a degree of impossibility of world $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$5, and $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$6 gives the least degree of impossibility among the worlds in $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$7. A proposition is therefore evaluated by its most plausible realization, but on a disbelief scale rather than a plausibility scale. The paper states the semantic consequence explicitly: “$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$8 means $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$9 is completely possible” (1304.1118).

This min-based semantics induces the characteristic algebra of rankings. For disjoint events $$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$0 and $$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$1,

$$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$2

The same property is used in the forgetting paper in the propositional form

$$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$3

Unlike probability, a disjunction is as unsurprising as its least surprising disjunct. RankPL therefore describes rankings as a qualitative calculus of uncertainty in which $$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$4 express increasing surprise, while $$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$5 marks impossibility (Rienstra, 2017, Beierle et al., 29 Aug 2025).

2. Belief, conditionals, and epistemic equivalence

A ranking function induces a propositional belief set from its rank-$$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$6 worlds. The forgetting framework defines

$$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$7

and equivalently

$$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$8

Its key belief criterion is

$$\kappa(\emptyset)=\infty,\qquad \kappa(A)=\min\{\kappa(w)\mid w\in A\}$$9

Thus a proposition is believed exactly when every most plausible world satisfies it (Beierle et al., 29 Aug 2025).

RankPL presents the same general idea with an explicit firmness parameter: $A$0 is believed with firmness $A$1 iff

$A$2

Under this criterion, belief is deductively closed under conjunction: if $A$3 and $A$4 are each believed with firmness $A$5, then so is $A$6. Both RankPL and Giang–Shenoy emphasize this as a distinguishing feature relative to probabilistic belief, and both connect it to the Lottery Paradox (Rienstra, 2017, Giang et al., 2013).

Ranking functions also support conditional acceptance. The forgetting framework treats $A$7 as accepted exactly when the best verifying worlds are more plausible than the best falsifying worlds: $A$8 Ordinary propositional belief is recovered as the special case

$A$9

This is one reason OCFs are treated as full epistemic states rather than as flat belief sets: they validate propositional beliefs and conditionals within the same plausibility ordering (Beierle et al., 29 Aug 2025).

The literature summarized here also distinguishes several notions of sameness between rankings. Two OCFs are epistemically equivalent if they preserve all pairwise world orderings: $\kappa(\Omega)=0.$0 A stronger arithmetic relation is linear equivalence: $\kappa(\Omega)=0.$1 If $\kappa(\Omega)=0.$2, then for any formula $\kappa(\Omega)=0.$3,

$\kappa(\Omega)=0.$4

This scaling property becomes important in forgetting, where some operators are evaluated against a ranking-specific linear-equivalence postulate $\kappa(\Omega)=0.$5 (Beierle et al., 29 Aug 2025).

Giang and Shenoy also define a derived Spohnian belief function

$\kappa(\Omega)=0.$6

Their purpose is again to connect ordinal disbelief with plain belief in a deductively closed form (Giang et al., 2013).

3. Conditioning, uncertain evidence, and iterated revision

Ordinary conditioning is the basic update mechanism. In RankPL, conditional rank is defined by

$\kappa(\Omega)=0.$7

and the conditioned ranking is $\kappa(\Omega)=0.$8 with

$\kappa(\Omega)=0.$9

At the world level, Dubois and Prade write, for $\kappa:\Omega\to\mathbb{N}$0,

$\kappa:\Omega\to\mathbb{N}$1

In both formulations, conditioning renormalizes the accepted event so that its best worlds receive rank $\kappa:\Omega\to\mathbb{N}$2; in RankPL the complement is shifted to $\kappa:\Omega\to\mathbb{N}$3, so observation is a very strong revision operation (Rienstra, 2017, 1304.1118).

Spohn’s treatment of uncertain evidence is different from ordinary conditioning. Dubois and Prade present the $\kappa:\Omega\to\mathbb{N}$4-conditionalization

$\kappa:\Omega\to\mathbb{N}$5

Its effect is to penalize $\kappa:\Omega\to\mathbb{N}$6 by an additional amount $\kappa:\Omega\to\mathbb{N}$7. The larger $\kappa:\Omega\to\mathbb{N}$8, the stronger the support for $\kappa:\Omega\to\mathbb{N}$9. In their comparison with possibilistic Jeffrey-style updating, this is the distinguishing mechanism: uncertain evidence is represented by rank shifts, not by averaging posterior states (1304.1118).

RankPL discusses two generalized ranking-theoretic revision schemes for noisy and iterated evidence. J-conditioning revises by finite firmness: $\kappa^{-1}(0)\neq\emptyset$0 Its effect is that $\kappa^{-1}(0)\neq\emptyset$1 becomes believed with firmness $\kappa^{-1}(0)\neq\emptyset$2, not with infinite firmness. Because $\kappa^{-1}(0)\neq\emptyset$3 is moved upward only finitely, later evidence can reverse the update. L-conditioning measures impact rather than target firmness: $\kappa^{-1}(0)\neq\emptyset$4 RankPL highlights two properties of L-conditioning: $\kappa^{-1}(0)\neq\emptyset$5 These are its reversibility and commutativity properties, respectively (Rienstra, 2017).

Dubois and Prade also give a general partition-based extension of Spohn updating: $\kappa^{-1}(0)\neq\emptyset$6 In the singleton-partition case with $\kappa^{-1}(0)\neq\emptyset$7, this yields

$\kappa^{-1}(0)\neq\emptyset$8

In that extreme case, generalized Spohn updating simply substitutes the new possibility distribution for the old one (1304.1118).

4. Possibility-theoretic and probabilistic correspondences

A central comparative result is the explicit connection between OCFs and possibility theory. Dubois and Prade define

$\kappa^{-1}(0)\neq\emptyset$9

They identify $B$0 as a necessity measure and $B$1 as the associated possibility distribution. At the set level,

$B$2

In the finite setting they consider, this gives an order-reversing exponential translation from disbelief to possibility: lower rank means higher possibility. Because $B$3, all $B$4 are strictly positive, so in that presentation “nothing is considered as fully impossible” (1304.1118).

Under this translation, certain conditioning coincides exactly between the two formalisms. Dubois and Prade write

$B$5

which matches the possibilistic conditioning rule

$B$6

At the set level,

$B$7

The relation becomes more delicate for uncertain information. Dubois and Prade’s own Jeffrey-like possibilistic update is

$B$8

with

$B$9

Their main conclusion is that Spohn’s rule is not simply another Jeffrey rule. If $\{A_1,\dots,A_m\}$0, both rules produce $\{A_1,\dots,A_m\}$1; if $\{A_1,\dots,A_m\}$2, the possibilistic rule yields $\{A_1,\dots,A_m\}$3, whereas Spohn’s rule may still replace the old state by the new one. Dubois and Prade interpret this as a difference between productive refinement and priority to the new information (1304.1118).

Giang and Shenoy study the relation to probability through explicit transformations between probability distributions and Spohnian disbelief functions. Their forward transformation $\{A_1,\dots,A_m\}$4 is constrained by ordinal congruence I: $\{A_1,\dots,A_m\}$5 To maximize retained ordinal information, they introduce leap indices for a non-increasing probability sequence $\{A_1,\dots,A_m\}$6: $\{A_1,\dots,A_m\}$7 If worlds are ordered so that $\{A_1,\dots,A_m\}$8, the transformation uses a disbelief counter $\{A_1,\dots,A_m\}$9 and remaining mass $\Omega$0: assign the current level $\Omega$1, subtract the current probability from $\Omega$2, and increment $\Omega$3 whenever $\Omega$4. Their Theorem 1 states that this $\Omega$5 is a least-coarse congruent probability-to-disbelief transformation (Giang et al., 2013).

The reverse transformation $\Omega$6 is governed by ordinal congruence II: $\Omega$7 If $\Omega$8 is the number of worlds in disbelief stratum $\Omega$9, then for $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$00,

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$01

where $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$02 is the normalization constant. This yields equal probability within each disbelief stratum and multiplicative discounting across strata. Giang and Shenoy prove that $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$03 is congruent, but also stress that the reverse direction is not unique and that

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$04

They also establish a dynamic compatibility result: $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$05 where $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$06 is densification. Thus transformation and conditioning commute up to removal of empty disbelief levels (Giang et al., 2013).

5. Programming-language realization and computational use

RankPL makes ranking theory operational by using ranking functions as the semantic domain of a qualitative probabilistic programming language. Its central semantic object is a transformation

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$07

from prior rankings over program states to posterior rankings over program states. Program states are valuations $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$08, the set of proper rankings is $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$09, and there is a special failure ranking $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$10 assigning $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$11 to every valuation; the semantic codomain is therefore

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$12

The language extends a small imperative core with three ranking-specific constructs: ranked choice, observation, and rank expressions (Rienstra, 2017).

The ranked choice

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$13

treats $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$14 as the normal branch and $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$15 as a surprising branch whose cost is the value of $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$16. Its denotation is

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$17

where

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$18

Observation implements conditioning: $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$19 Conditionals and loops are defined denotationally by splitting, conditioning, recombining, and iterating rankings rather than by numerical probability propagation (Rienstra, 2017).

The paper’s examples illustrate how this semantics is used. A toy program with nested ranked choices yields three outcomes, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$20 of rank $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$21, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$22 of rank $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$23, and $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$24 of rank $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$25; adding an observation $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$26 removes the first outcome and shifts the others down to ranks $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$27 and $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$28. A full-adder diagnosis example uses surprise penalties on component failures and an observation of anomalous input-output behavior to rank explanations abductively; for the specified observation, the posterior ranking has a unique rank-$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$29 explanation in which one particular XOR gate fails. A robot-localization example uses L-conditioning with strength $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$30 to incorporate noisy sensor readings without rendering inconsistent alternatives unrevisable; after misleading observations, later evidence restores the actual location to rank $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$31 (Rienstra, 2017).

RankPL also emphasizes implementation. Its interpreter is described as faithful to the denotational semantics and uses a most-plausible-first execution strategy, exploring alternatives in ascending order of rank. This exploits a practical property of ranking semantics: in diagnosis and abduction, the most plausible outcomes are typically the primary target (Rienstra, 2017).

6. Forgetting, contraction, and epistemic-state change

The 2025 framework treats forgetting as an operation on epistemic states with richer structure than a belief set. In that setting, forgetting may affect propositional beliefs, accepted conditionals, relevance structure, and the plausibility ordering itself. Five abstract kinds of epistemic forgetting are distinguished for a contingent formula $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$32: contraction, ignoration, revocation, marginalization, and conditionalization. The OCF instantiation then yields seven concrete forgetting operators (Beierle et al., 29 Aug 2025).

Operator	Defining pattern	Principal role
OCF-marginalization	$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$33	variable forgetting / language reduction
Lifted marginalization	$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$34	variable forgetting while preserving the original signature
Conditionalization	$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$35	revocative forgetting by moving to the $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$36 context
c-Ignoration	c-contraction with $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$37	suspension of judgment between $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$38 and $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$39
c-Revocation	c-contraction with $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$40	forgetting $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$41 by accepting $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$42
Minimal c-contraction	c-contraction with $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$43	AGM-style contraction
Non-minimal c-contractions	c-contractions with $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$44	broader contraction family beyond the minimal case

OCF-marginalization to a subsignature $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$45 is defined by

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$46

Its associated forgetting operation is

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$47

This is the semantic counterpart of variable elimination. The paper proves the exact compatibility result

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$48

and therefore

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$49

Lifted marginalization keeps the original signature but makes forgotten atoms irrelevant to plausibility by defining

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$50

Conditionalization, by contrast, is

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$51

so it behaves more like revision by $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$52 than like variable forgetting (Beierle et al., 29 Aug 2025).

The contraction-style family is numerically defined by world-rank shifts. For contingent $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$53, a c-contraction $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$54 is characterized by the existence of an integer $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$55 such that

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$56

and

$\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$57

Different choices of $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$58 yield ignoration, revocation, minimal contraction, and non-minimal contraction. Minimal c-contraction is singled out as the canonical AGM-style forgetting operator; c-ignoration is the unique strategy that makes at least one $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$59-world and one $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$60-world rank $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$61, thereby believing neither $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$62 nor $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$63 (Beierle et al., 29 Aug 2025).

The postulate analysis provides a sharp classification. OCF-marginalization satisfies AGM(1), AGM(3), AGM(5), AGM(6), $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$64, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$65, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$66, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$67, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$68, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$69, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$70, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$71, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$72, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$73, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$74, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$75, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$76, and $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$77, but violates AGM(2), AGM(4), AGM(7), and $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$78. Minimal c-contraction satisfies AGM(1)–AGM(7), $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$79, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$80, $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$81, and $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$82, but violates the persistence and weakening-style postulates. Conditionalization and c-revocation are close to revision by negation; c-ignoration models neutrality about $\kappa:\Omega\to \mathbb{N}\cup\{\infty\},$83; non-minimal c-contractions lack the rationality guarantees of the minimal variant. The framework’s own synthesis is therefore that OCF-marginalization is the canonical realization of variable forgetting, whereas minimal c-contraction is the canonical realization of AGM contraction (Beierle et al., 29 Aug 2025).

Across these applications, ranking functions are treated not merely as numeric annotations on worlds but as structured epistemic states. That is why the same formalism supports propositional belief, conditional acceptance, revision, contraction, marginalization, and forgetting, and why two states with the same propositional belief set can still behave differently under forgetting or update if their plausibility orderings differ (Beierle et al., 29 Aug 2025).