Why Is the Algorithm Correct ?
•Show the following by induction:
–For every B in X:
•A1, …, An
B
•Initially X = {A1,
…, An} -- holds
•Induction step: B1,
…, Bm in X
–Implies A1, …, An
B1, …, Bm
–We also have B1,
…, Bm C
–By transitivity we have A1, …, An C
•This shows that the algorithm is sound; need to
show it is complete
