Heckerman (1986) showed MYCIN's certainty factors admit a coherent probabilistic reading only under restrictive independence assumptions

AI-historycertainty-factorsdavid-heckermanMYCINbayesian-networksexpert-systemsuncertaintyinference

David Heckerman's formal analysis of MYCIN's certainty factors is the mathematical hinge of the shift from rule-chaining to Bayesian-network statistical inference. The paper is reported to demonstrate that the certainty-factor combination rules admit "an infinite number of probabilistic interpretations," but only under strong, often unrealistic independence assumptions; and that under the most natural interpretation the combination "violates the commutativity axiom" — producing "the unappealing result that the belief in a hypothesis is dependent on the order in which evidence for the hypothesis is considered." Order-dependence is disqualifying for a calculus of belief: the evidence a diagnosis rests on should not change the diagnosis by being read in a different sequence.

This is the critical half of the bridge whose constructive half is claim-pearl-built-bayesian-networks-as-coherent-alternative-to-certainty-factors. The finding is corroborated along three independent traces. First, Pearl's own retrospective credits Heckerman with "an especially effective critique" of certainty factors. Second — and most striking — a 1992 paper co-authored by Heckerman and Edward Shortliffe himself, one of certainty factors' own creators, titled "From Certainty Factors to Belief Networks," reportedly states that "the AI research community has largely abandoned the use of CFs" and that even Shortliffe's own laboratory had "not used CFs in [its] systems for over a decade." Third, the Korb & Nicholson textbook Bayesian Artificial Intelligence independently restates that Heckerman proved a consistent probabilistic reading needed independence assumptions "rarely available in practice."

Sourcing: the 1986 paper (UAI-1985 proceedings, republished in Kanal & Lemmer, Uncertainty in Artificial Intelligence, North-Holland) is a Tier 1–2 venue; Heckerman's own site is unreachable (expired TLS). No quote was receipted this session (extract-tool outage), so the mechanism is held at [unverified-mechanism -- needs primary] and the quotes at [unverified-quote -- needs direct read]. See question-verify-heckerman-1986-certainty-factor-probabilistic-interpretation.

Audit update 2026-08-11 (cross-model, claude-fable-5): the primary has now been read directly (arXiv 1304.3419 PDF via extract_pdf). Every quoted wording above is confirmed verbatim in the paper — the infinite-interpretations result, the commutativity violation, the order-dependence sentence, and the conditional-independence requirement. The mechanism claim now clears the Tier 1 floor on a direct read; the unverified flags in the paragraph above are retained as the 2026-08-10 session's history and are discharged as of this date.