Set Friday Oct 18th, due Friday Nov 8th
Read the appropriate parts of the course books,
i.e. chapter 21 of Bratko, and chapter 19 of Sterling and Shapiro
for logic grammars and chapter 11 of Bratko
and chapter 14 of Sterling and Shapiro for problem solving.
Extend the Bratko DCG grammar, shown here
http://www.cs.caltech.edu/~bond/courses/cs101b/slides/logic11/node11.html
and also to be found as a file at
~cs101/logic/talk/bratko/bratko_dcg.pl,
to provide for the processing
of sentences required for the Tower of Hanoi task.
Input sentences should
specify the initial state and the final state,
the allowed moves, and criteria for the solution.
Your grammar should read in the statements and
construct Prolog clauses representing their meanings
which can be used in solving the problem.
Provide a general search program that will use this description
and will search the state space of the problem and
find the solution.
Please set up a web page with your solutions and email the URL
both to me and to our TA Adam at granicz@cs.caltech.edu.