CSE 327 AI Theory and Practice, Spring 2006
Professor Jeff Heflin
MWF 11:10am-12:00pm, Packard Lab 208
Check here for updates regarding the course.
- 5/3/06 - Homework #7 has now been graded and the solutions have been posted.
- 4/28/06 - The TA and I have special office hours for finals week. I will hold office hours in Packard 330 from 10-11am on Monday May 1, and from 3-4pm on Wednesday, May 3. The TA will hold office hours from 1-4pm on Monday May 1 in Packard 250. These supercede our usual office hours.
- 4/28/06 - I have posted a study guide for the final.
- 4/27/06 - Our final exam is scheduled on Thursday, May 4 from 8-11am and will be held in Packard 466.
- 4/24/06 - Homework #7 was assigned today.
- 4/14/06 - Homework #6 was assigned today.
- 3/31/06 - Homework #5 was assigned today.
- 2/28/06 - I will be out of town Tue. 3/28 to Thr. 3/30. Prof. Munoz-Avila will give a guest lecture in class on Wednesday. Thursday's office hours are canceled.
- 2/23/06 - The midterm will be on Monday, Feb. 27. We will spend some of Friday's lecture discussing the format and coverage of the midterm. I have included a study guide for the midterm.
- 2/20/06 - Homework #3 was assigned today.
- 2/8/06 - Homework #2 was assigned today.
- 1/30/06 - In HW #1, problem #5, you are allowed to perform the goal test when a node is generated, as opposed to waiting until it is expanded. For breadth-first search this does not change the outcome of the algorithm, but it will allow you to avoid generating the entire 5th level, which has more than 15 nodes!
- 1/27/06 - Homework #1 was assigned today.
This course will provide a general introduction to Artificial Intelligence(AI). We will discuss what AI is, survey some of the major results in the field, and look at a few promising directions. In particular, we will seek answers to questions such as:
Our examination of these problems will focus on various data structures and algorithms that have been proposed as solutions.
- How do you represent and reason with general-purpose knowledge?
- How can a robot or artificial agent formulate a plan to achieve a task?
- How can an agent learn in order to improve its behavior or cope with unanticipated situations?
For details about course content, grading, assignments, and office hours, see the class syllabus.
Each of the homeworks will be made available here after they are
handed out in class. The online versions of the homework are in PDF format.
Your readings will be listed below as they are assigned. Unless otherwise specified, all readings are from our textbook, Artificial Intelligence: A Modern Approach.
|Read Ch. 1 (pp. 1-29)||1/18|
|Read Ch. 2 (pp. 32-54)||1/20|
|Read Sect. 3.1-3.2 (pp. 59-68)||1/23|
|Read Sect. 3.3-3.4 (pp. 69-81)||1/25|
|Read Sect. 3.5 (pp. 81-83)||1/27|
|Read Sect. 4.1 (pp. 94-104)||1/30|
|Read Sect. 4.2 (pp. 104-110)||2/1|
|Read Sect. 6.1-6.2 (pp. 161-167)||2/3|
|Read Sect. 6.4, 6.6-6.8 (pp. 171-175, 180-186)||2/6|
|Read Sect. 7.1-7.4 (pp. 194-211)||2/8|
|Read Sect. 8.1 (pp. 240-244)||2/13|
|Read Sect. 8.2 (pp. 245-253)||2/15|
|Read Sect. 8.3 (pp. 253-260)||2/17|
|Read Sect. 8.4-8.5 (pp. 260-266)||2/20|
|Read An Introduction to Prolog Programming by Ulle Endriss, Chapter 1 (pp. 5-15)||2/22|
|Read Sect. 9.1-9.2 (pp. 272-280)||2/24|
|Read Sect. 9.4 (pp. 287-295)||3/1|
|Read Sect. 10.1-10.2 (pp. 320-328)||3/3|
|Read Sect. 10.5-10.6 (pp. 344-354)||3/13|
|Read Sect. 11.1 (pp. 375-382)||3/15|
|Read Sect. 11.2 (pp. 382-387)||3/17|
|Read Sect. 11.3 (pp. 387-395)||3/22|
|Read Sect. 12.2 (pp. 422-430)||3/29|
|Read Sect. 3.6, 12.3-12.4 (pp. 83-87, 430-440)||3/31|
|Read Sect. 12.5-12.6 (pp. 441-449)||4/3|
|Read Sect. 13.1-13.4 (pp. 462-477)||4/5|
|Read Sect. 13.5-13.8 (pp. 477-486)||4/7|
|Read Sect. 14.1-14.2 (pp. 492-499)||4/10|
|Read Sect. 14.4 (pp. 504-510)||4/12|
|Read Sect. 16.1-16.4 (pp. 584-597)||4/14|
|Read Sect. 18.1-18.2 (pp. 649-653)||4/17|
|Read Sect. 19.1 (pp. 678-682 only)||4/19|
|Read Sect. 19.1 (pp. 683-686 only)||4/21|
|Read Sect. 20.5 (pp. 736-743 only)||4/24|
|Read Sect. 20.5 (pp. 744-748)||4/26|
Additional Class Materials
- Contains information on course content, grading, assignments, and office
- Supplemental Slides
- This directory contains the slides that I use in class. Note, these slides only cover part of the lecture, and should not be used as a substitute for it.
- Midterm Study Guide
- This document briefly discusses the format of the test, and provides a partial list of topics you need to know for the test. It also explicitly lists topics you do not need to know.
- An Introduction to Prolog Programming by Ulle Endriss
- Gives a light weight introduction to Prolog syntax, queries, and style.
- SWI-Prolog is free software. If you are using a personal machine, you can download SWI-Prolog from the web page listed below. If you are in a Lehigh computer lab, you should install it via the Lehigh Software page. A link to the online reference manual is also provided.
- SWI-Prolog Homepage
- SWI-Prolog Reference Manual
- Sample Prolog programs
- These are the examples that were shown in class
- Final Study Guide
- This document briefly discusses the format of the final, and provides a partial list of topics you need to know for the test. It also explicitly lists topics you do not need to know.