Module inference 

Naive inference and defeasible revision over likeliness — the “specific update rule” half of the calculus. Built on the super::algebra lattice so the laws are inherited (reuse, not a parallel set of rules).

Functions

attenuate

Lower a likeliness by steps ordinal levels — chain attenuation. Saturating at Impossible.

infer_chain

Inference along a chain of default rules from a premise: the weakest link, then attenuated by the number of inferential steps beyond the first. Longer defeasible chains weaken — the qualitative analogue of multiplying probabilities along a path. An empty rule list returns the premise unchanged.

modus_ponens

Naive modus ponens. From a premise p (how expected it is to hold) and a rule’s reliability r (how expected it is that p ⇒ q), the conclusion q is and(p, r) — inference never produces a conclusion stronger than its weakest input.

rebut

Rebuttal. A counter-argument of strength counter (how expected it is that the conclusion is false) caps the conclusion at not(counter). A strong rebuttal defeats: a Certain conclusion rebutted by a Likely counter falls to Unlikely.

revise

Defeasible revision. Fold a new supporting route and a rebuttal into a prior: and(or(prior, support), not(against)). The support is an alternative route (best-of), and the rebuttal caps the result. Symmetric in the sense that a strong against overrides any amount of support.