Go backward to Solution to part (g)
Go up to 3 Variable Elimination Algorithm (Singly Connected)
Solution to part (h)
For this example, we can interpret all of the factors as conditional
(a) f1(D) represents P(D).
(b) f2(B,C) represents P(C|B).
(c) f3(F) represents P(g|F).
(d) f4(C) represents P(g|C).
(e) f5(B) represents p(g|B).
(f) f6(A) represents p(g &A).
material, ©David Poole, Alan Mackworth and Randy Goebel, 1999