Topics in Artificial Intelligence 308-424A G. Dudek

Assignment #1

(Recall assignment 0 will not be marked. This assignment will be.)

Due: Sept. 28 AT THE START OF CLASS.

DO NOT SUBMIT ASSIGNMENTS IN CLASS, USE THE DROP-OFF BOX.

DO NOT SUBMIT ASSIGNMENTS TO UNDER MY DOOR OR TO ME IN PERSON.

Work is to be done independently. Please see the policy on due dates, cheating and inappropriate collaboration accessible via the class web page.

Required software available via the class web page.

Pedagogical objectives of this assignment:

• Illustrate the use of predicate calculus in problem representation.
• Illustrate the use of logic-based representation of problem representation and solution.
• Motivate the use of PROLOG illustrating logic-based problem solving, and the decoupling of the representation and the algorithm.
• Illustrate the notion of a problem state space to serve as an introduction to search.

Problem statement:

Q. 10.3 (a) thru (d) in the text [R&N]

Q. 10.5 in the text [R&N]

Requirements:

Write a PROLOG program to prove that a solution exists. A consequence of the proof process will be a specific solution.

Submit a complete assignment, including example output, on paper. Your written responses should be typed.

Submit your program electronically using the "handin" program. We may use it to verify your solution. Do not assume, however, that we will necessarily examine it (on other words, the paper submission should be complete, consistent and not need to refer to other material).