TTh 1400-1515 SWGN 2A24
Prerequisites: CSCE 350 (Data Structures and Algorithms).
Instructor: Marco Valtorta
Office: Swaeringen 3A55, 777-4641
Office Hours: 1100-1200 MWF
Any student with a documented disability should contact the Office of Student Disability Services at (803)777-6142 to make arrangements for proper accommodations.
Grading and Program Submission Policy
Grades per assignment
Homework 1: definition of AI, state of the art
Homework 2: Exercises 3.3 and 3.4 [P].
Homework 3: Exercises 4.1 and 4.3 [P], due October 25, 2011.
Homework 4: Enter the crosswork problem of 4.3(a) and 4.1(c) [P] in the CSP applet at AISpace. Solve with the generalized arc consistency algorithm. Turn in a printout of the netwok after the GAC algorithm stops. (This will not be a unique solution.) This homework is due on Thursday, October 27.
Homework 5: Exercises 4.2, 4.4, and 4.11 [P], due November 1, 2011.
Program 1: exercises 1, 4, and 6 from Ch. 22 of Luger and Stubblefield (copy on blackboard), due on Thursday, November 10.
Program 2 (PR2): exercise 5.13 [P], due Tuesday, November 22. (Use AILog. Turn in hardcopy with code and a sample run.)
Homework 6 (HW6): Exercises 5.7 and 5.8 [P], due Tuesday, November 22. (You may use AILog for these exercises, if you find it convenient.)
Homework 7: Exercise 6.2 [P], due Thursday, December 1.
Most lecture use notes from the authors of the texbook. (See link under "reference materials," above.)
Overhead transparencies for [P] are linked to the main page for [P]; the specific link is here.
Introductory lectures, covering chapter 1 of [P]
Agent Architectures and Hierarchical Control, covering chapter 2 of [P]
States and Searching, covering chapter 3 of [P]
Uninformed (Blind) Search, covering chapter 3 of [AIMA-2]
Heuristic Search, covering chapter 4 of [AIMA-2]
Notes on properties of A*, as written in class of 2011-09-08
Notes on computing heuristics by problem relaxation, as written in class of 2011-09-13
Notes on Valtorta's Theorem on the complexity of heuristics for A*, as written in class of 2011-09-13
M. Valtorta. "A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm." Information Sciences, 34, 47-59 (1984).
Features and Constraints, covering chapter 4 of [P]
Notes on submission format for PR1.
Notes on search algorithms in Java, used by Jingsong Wang on 2011-10-18.
Notes on HW3, especially exercises 4.3(a) and (c) [P], as written in class of 2011-10-25
Propositions and Inference, covering chapter 5 of [P] (Note: some of these slides may be different from the latest version available directly from the authors of [P].
Notes from the review session of 2011-12-06.
Quizzes (In-Class Exercises)
The USC Blackboard has a site for this course.
Prolog Information (To be
Some useful links:
Some useful links: