Errata of Dr. Gelfond’ Notes
Here only list some important one.
Then–>Than
Lower Bound Algorithm condition 3. Condition should be stronged as the one and the only one to fuarantee the conclusion.
Example2 for the Lower Bound Algorithm. It should stop in the previous step. There is a contradiction in the final step.
For other errors please contact licody202 at yahoo. com. cn. These errors are as of 12/01/2007 from Dr. Gelfond lecture notes for CS5368 Intelligent System.
Any comments are welcome!
