Reasoning Under Uncertainty (7hrs) · Introduction to AI

Certainty factors and rule-based uncertainty (overview)

Watch lectures

Certainty Factors and Rule-Based Uncertainty (Overview) — Beginner-Friendly Notes

1. Why This Topic Exists (historical patch)

Classic rule-based systems (MYCIN) were logical but brittle — they needed to handle "maybe". Before full Bayes became practical, they invented Certainty Factors (CFs) as a heuristic blend of belief and disbelief.

Think: CF = quick, modular uncertainty for if-then rules before you learn Bayes nets.

2. Definition (one line)

For hypothesis HH given evidence EE:

  • Measure of Belief MBMB: increase in belief in HH due to EE.
  • Measure of Disbelief MDMD: increase in disbelief.
  • Certainty Factor: CF(H,E)=MB(H,E)−MD(H,E)CF(H,E) = MB(H,E) - MD(H,E)

Range: CF∈[−1,+1]CF \in [-1, +1]:

  • +1+1 = definitely true, −1-1 = definitely false, 00 = no information / unknown.
  • Often scaled to [-100, +100] or [0,1] in systems.

Example: CF(fever⇒flu)=0.6CF(fever \Rightarrow flu) = 0.6 means "fever somewhat confirms flu".

3. How It Propagates (overview — combining evidence)

  • Rule with CF: IF EE with CF(E)CF(E) THEN HH with CF(rule)CF(rule) → CF(H)=CF(rule)⋅max⁡(0,CF(E))CF(H) = CF(rule) \cdot \max(0, CF(E)) (one common form; variants exist).
  • Combine two rules concluding same HH:
    • If both positive: CFcomb=CF1+CF2−CF1⋅CF2CF_{comb}=CF1+CF2-CF1\cdot CF2
    • If both negative: CFcomb=CF1+CF2+CF1⋅CF2CF_{comb}=CF1+CF2+CF1\cdot CF2
    • If opposite signs: CFcomb=CF1+CF21−min⁡(∣CF1∣,∣CF2∣)CF_{comb}=\frac{CF1+CF2}{1-\min(|CF1|,|CF2|)}
  • Common pitfall: combining via these formulas is ad-hoc, not probabilistically sound — but computationally cheap and modular (adding a rule just composes CFs).

4. CF vs Probability (exam contrast)

Certainty Factor Probability (Bayes)
Semantics Heuristic degree of belief/disbelief, no formal sample space Formal P(H∣E)∈[0,1]P(H|E) \in [0,1] with Dutch-book coherence
Modularity Modular — each rule's CF independent Not modular — P(H∣E1,E2)P(H|E1,E2) needs joint, Bayes nets handle it
Calibration Often tuned by experts, not data Learned from data / coherent inference
Today Historical — replaced by Bayes nets, but still asked Modern standard

5. Why Still Taught

  • Shows evolution: from logic → CF → probability and why probability won.
  • Some expert systems still report CF-like scores ("confidence 0.85").

6. One-Line Summary

Certainty factors quantify belief as CF=MB−MD∈[−1,1]CF=MB-MD \in [-1,1] with heuristic combination rules, offering modular rule-based uncertainty that is computationally simple but lacks the formal coherence of probability and Bayesian networks.

7. Quick Self-Check

  1. What does CF=−0.8CF=-0.8 mean?
  2. Why is CF1+CF2−CF1⋅CF2CF1+CF2-CF1\cdot CF2 less than 1 even if both are 0.8?
Free AppAndroid App

Coursify Android App

Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.

← All Introduction to AI modules