CSE 327 AI Theory and Practice, Spring 2010
Professor Jeff Heflin
MWF 9:10am-10:00am, Maginnes 110
Check here for updates regarding the course.
- 5/9/10 - HW #7 is graded. If you would like to see yours before the exam come by office either 10-11am Monday, May 10 or 3-4pm Tuesday, May 11. I have also posted the solutions below.
- 4/29/10 - I have posted a study guide for the final.
- 4/27/10 - Our final will be on Wed., May 12 from 8-11am in Packard 258. On Friday, we'll do a short review.
- 4/26/10 - There's a typo in 3b) of Homework #7. Where it says "training set from #1 above" it should say "training set from part a) above." That is, use the training set developed by converting Table 1 to description and classification sentences.
- 4/23/10 - Homework #7 was assigned today. It is due Friday, Apr. 30.
- 4/12/10 - Homework #6 was assigned today. It is due Monday, Apr. 19.
- 3/31/10 - Homework #5 was assigned today. It is due Wednesday, Apr. 7.
- 3/17/10 - Homework #4 was assigned today. It is due Wednesday, Mar. 24.
- 2/22/10 - Homework #3 was assigned today. It is due Monday, Mar. 1.
- 2/15/10 - Homework #2 was assigned Friday. It is due Friday, Feb. 19.
- 01/29/10 - Homework #1 was assigned today. It is due Friday, Feb. 5.
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 make good decisions given uncertainty about its environment?
- How can an agent learn in order to improve its behavior or cope with unanticipated situations?
Russell, Stuart and Peter Norvig, Artificial Intelligence: A Modern Approach (second edition). Prentice-Hall, New Jersey, 2003. ISBN 0-13-790395-2
Mon. 10:10-11:30am, Thr. 2-3:30pm and by appointment in Packard Lab 330
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/20|
|Read Sect. 2.1-2.3 (pp. 32-44)||1/22|
|Read Sect. 2.4-2.5 (pp. 44-54)||1/25|
|Read Sect. 3.1-3.3 (pp. 59-73)||1/27|
|Read Sect. 3.4-3.5 (pp. 73-83)||1/29|
|Read Sect. 4.1 (pp. 94-105)||2/1|
|Read Sect. 4.2 (pp. 105-110)||2/3|
|Read Sect. 6.1-6.2 (pp. 161-167)||2/5|
|Read Sect. 6.4, 6.6-6.8 (pp. 171-175, 180-186)||2/8|
|Read Sect. 7.1-7.3 (pp. 194-204)||2/10|
|Read Sect. 7.4 (pp. 204-211)||2/15|
|Read Sect. 7.7 (pp. 225-227), 8.1 (pp. 240-244)||2/17|
|Read Sect. 8.2 (pp. 245-253)||2/19|
|Read Sect. 8.3-8.5 (pp. 253-266)||2/24|
|Read An Introduction to Prolog Programming by Ulle Endriss, Chapter 1 (pp. 1-12)||2/26|
|Read Sect. 7.5 (pp. 211-220)||3/1|
|Read Sect. 9.1-9.2, 9.4 (pp. 272-280, 287-298)||3/5|
|Read Sect. 10.1-10.2, 10.5-10.6 (pp. 320-328, 344-354)||3/15|
|Read Sect. 11.1-11.2 (pp. 375-387)||3/19|
|Read Sect. 11.3 (pp. 387-395)||3/24|
|Read Sect. 12.3, 12.6 (pp. 430-432, 445-449))||3/29|
|Read Sect. 13.1-13.2 (pp. 462-471)||3/31|
|Read Sect. 13.3-13.8 (pp. 471-486)||4/2|
|Read Sect. 14.1-14.2 (pp. 492-499)||4/5|
|Read Sect. 14.4 (pp. 504-510)||4/9|
|Read Sect. 15.1-15.2, 15.6 (pp. 537-549,568-577)||4/12|
|Read Sect. 16.1-16.3 (pp. 584-593)||4/14|
|Read Sect. 18.1-18.2 (pp. 649-653)||4/16|
|Read Sect. 18.3 (pp. 653-664)||4/19|
|Read Sect. 19.1 (pp. 678-682 only)||4/21|
|Read Sect. 20.5 (pp. 736-743 only)||4/23|
|Read Sect. 20.5 (pp. 744-748 only)||4/26|
|Skim Ch. 26 (pp. 947-964)||4/30|
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.
- Search Strategy Code
- A ZIP file containing Java classes that implement three different best-first search strategies. The code is designed to be extended with definitions of specific search problems, so that it can then be used to solve those problems. This code should be used when performing the Extra Credit exercise of HW #2. This code is intended only for use in conjunction with CSE 327 at Lehigh, and is not authorized for any other purpose.
- 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.
- 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.
- 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.