Documentation

Linglib.Theories.Semantics.Causation.Strength

Causal Strength Models #

@cite{icard-et-al-2017}

Theory-layer definitions for causal strength: computational models that rank candidate causes by importance, given a causal model.

Two models are formalized:

  1. Necessity-Sufficiency Model (NSM, @cite{icard-et-al-2017}): NSM(C) = P(C) · Suf(C) + (1 − P(C)) · Nec(C)

  2. Sampling propensity (shared by NSM and CESM): SP(V) = s · ⟦V⟧^w@ + (1 − s) · P(V)

These definitions are theory-layer infrastructure imported by study files (e.g., KonukEtAl2026, BellerGerstenberg2025).

Sampling Propensity #

The probability that a variable retains its actual-world value in a counterfactual sample. Interpolates between the actual value (stability parameter s) and the prior probability (1 − s).

def Semantics.Causation.Strength.samplingPropensity (s actualValue priorProb : ) :

Sampling propensity of a binary variable V.

  • s: stability parameter ∈ [0,1] — probability of copying the actual value
  • actualValue: ⟦V⟧^w@ ∈ {0,1} — the variable's value in the actual world
  • priorProb: P(V) — the prior probability of V being true
Equations
Instances For

    At s = 0, sampling propensity reduces to the prior.

    At s = 1, sampling propensity reduces to the actual value.

    Necessity-Sufficiency Model (NSM) #

    The causal strength of a candidate cause C for outcome E, computed as a weighted combination of sufficiency and necessity scores.

    def Semantics.Causation.Strength.nsm (pC suf nec : ) :

    NSM formula: NSM(C) = P(C) · Suf(C) + (1 − P(C)) · Nec(C).

    • pC: prior probability (or sampling propensity) of the cause
    • suf: sufficiency score ∈ [0,1]
    • nec: necessity score ∈ [0,1]
    Equations
    Instances For
      theorem Semantics.Causation.Strength.nsm_suf_one (pC nec : ) :
      nsm pC 1 nec = pC + (1 - pC) * nec

      When Suf = 1, NSM simplifies to P(C) + (1 − P(C)) · Nec.

      theorem Semantics.Causation.Strength.nsm_suf_nec (pC : ) :
      nsm pC 1 1 = 1

      Sufficient and necessary: NSM = 1 regardless of probability.

      theorem Semantics.Causation.Strength.nsm_suf_only (pC : ) :
      nsm pC 1 0 = pC

      Sufficient but not necessary: NSM = P(C).

      theorem Semantics.Causation.Strength.nsm_nec_only (pC : ) :
      nsm pC 0 1 = 1 - pC

      Necessary but not sufficient: NSM = 1 − P(C).

      theorem Semantics.Causation.Strength.nsm_neither (pC : ) :
      nsm pC 0 0 = 0

      Neither sufficient nor necessary: NSM = 0.

      theorem Semantics.Causation.Strength.nsm_mono_suf (pC nec : ) (hpC : 0 pC) (s₁ s₂ : ) (h : s₁ s₂) :
      nsm pC s₁ nec nsm pC s₂ nec

      NSM is monotone in sufficiency.