Due Tuesday, Feb 6, Python code submitted through
Catalyst E-Submit
at 11:59 PM.
Part 1 (Written answers)
Ch4 (Knowledge Rep.), p. 158: exercise 14. (Encode facts in prop. calc.)
Ch4 (Knowledge Rep.), p.158: exercise 15a. (encoding numeric quantification in pred. calc.)
Ch4 (Knowledge Rep.), p.159: ex. 17. (Pred. calc. encoding)
Ch4 (Knowledge Rep.), p.159: ex. 19. (Interpretations and models in logic)
Ch6 (Logical Reasoning), p. 255: ex. 1. (satisfiability)
Ch6 (Logical Reasoning), p. 255: ex. 2. (Wang's method)
Ch6 (Logical Reasoning), p. 255: ex. 4. (Perfect induction)
Ch6 (Logical Reasoning), p. 255: ex. 5. (Prop. Calc. resolution)
Ch6 (Logical Reasoning), p. 255: ex. 8. (unifiers)
Ch6 (Logical Reasoning),
p. 255: ex. 11 (Prolog-based expert systems). You may use Horn clause resolution in
Python instead of Prolog.
Part 2 (Programming)
Code up your answer to the last exercise in Part 1 in either
Prolog or the Mock Prolog Interpreter in Python.
The Mock Prolog interpreter is available at
our website.
A free Prolog interpreter is available at
SWI Prolog.
|
