CSC 2401 Assignments

1. Due Tuesday Sept 19th. Do exercise 2.3 page 50.
2. Due Friday Oct 6th
   a.) Do exercise 3.4 on page 88. Note that you only need to define the state space as the breadth first search algorithm is in "~jhodgson/ugai/searches"
   b). Write a prolog predicate flatten(+List, -Flat) that flattens a list. So that
   flatten([1,2,[3,4,5], [5,[6,7]]], [1,2,3,4,5,5,6,7]) is true.
3. Due Friday November 3rd.
   a.) Exercise 6.12 of AIMA
   b.) Exercise 6.14 of AIMA. Hints will be given in the upcoming classes.
   c.) Exercise 7.9 of AIMA.
   
4. Due Fiday November 17th a). AIMA Exercise 9.2
   b) AIMA Exercise 9.4 only write prolog clauses to represent the sentences and then find all solutions to horse(X).
   (Warning. Be careful how you implement sentence e.)
   
5. Due Tuesday December 5.
   Do exercise 11.4 on page 365. This is a paper and pencil; exercise. You do not have to write a program.
6. On the final examination you will be expected to understand Definite Clause Grammars. Take some time now to think about how you might use such grammars to accept sentences such as

   Are there any green blocks?
   Is block 7 blue?

   but not the sentences

   Is there any green blocks?
   Are block 7 blue?

   You may ignore punctuation.

Midterm Examination. Friday October 27th 1995

Return to UG AI home page

Last Changed: 6 November 1995