CSE 327 AI Theory and Practice, Spring 2013
Professor Jeff Heflin
MWF 10:10-11:00am, STEPS 490
Check here for updates regarding the course.
- 5/2/13 - I have posted the solutions to HW #7
- 4/29/13 - My office hours during finals are T 4/30: 2-3:30pm, F 5/3: 10-11:30am, and by appointment
- 4/25/13 - There appears to be confusion with some of the problems in the homework.
- #3) Since all hidden and output units use the threshold activation function, each can only output a 0 or 1, depending on the threshold x as specified by the t=x notation.
- #4a) When using the Tail(x,t) notation in description sentences, replace x with the constant for a specific example and t with either Yes or No. Likewise, when using Fur(x,f), replace f with either Yes or No.
- #4b) Remember that when you specialize a hypothesis, your new hypothesis must first be consistent with the new example, and then you must check that it is consistent with all previous examples. Always make the smallest possible change, typically by adding a single conjunct, and consider all such consistent changes as possible branches.
- 4/25/13 - I have posted a study guide for the final.
- 4/22/13 - Our final will be held Sat. May 4, 8-11am in Chandler-Ullmann 230
- 4/12/13 - There is a bit of ambiguity in #2 of your homework (14.6 from the book). s is the probability that the handedness of the individual has the same value as their gene. m is the probability that the value for a child's gene (i.e., l or r) is different from the value of the parent that they inherit the gene from.
- 2/22/13 - I have posted a study guide for the midterm that will be held in class on Friday, March 1.
- 1/26/13 - A student has pointed out some problems with your homework assignment. I have posted a revised version. In particular, the initial state of problem #5 should be changed in these ways:
These changes mean that the tree will have nine levels, not including the root.
Finally, the figure mentioned in problem #6 should be Figure 3.2 (p. 68). I appologize for the confusion.
- remove the 3 from the top right corner
- remove the 2 from the first column, third row
- add a 4 to the bottom right corner
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?
For details about course content, grading, and assignments, see the class syllabus.
Russell, Stuart and Peter Norvig, Artificial Intelligence: A Modern Approach (third edition). Prentice-Hall, New Jersey, 2010. ISBN 0-13-604259-7
Mon. 11:10am-noon, Thr. 1:30-3:30pm and by appointment in Packard Lab 330
No office hours on 1/31 or 2/7
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.
- Homework #1 (revised 1/26), due Feb. 1
- Homework #2, due Feb. 13
- Homework #3, due Feb. 25
- Homework #4, due Mar. 25
- Homework #5, due Apr. 3
- Homework #6, due Apr. 15
- Homework #7, due Apr. 26
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-30)||1/16|
|Read Sect. 2.1-2.3 (pp. 34-46)||1/18|
|Read Sect. 2.4-2.5 (pp. 46-59)||1/21|
|Read Sect. 3.1-3.3 (pp. 64-81)||1/23|
|Read Sect. 3.4 (pp. 81-91)||1/25|
|Read Sect. 3.5 (pp. 92-102)||1/28|
|Read Sect. 3.6-3.7 (pp. 102-109)||1/30|
|Read Sect. 5.1-5.2 (pp. 161-167)||2/1|
|Read Sect. 5.4 (pp. 171-176)||2/4|
|Read Sect. 5.7-5.9 (pp. 180-186)||2/6|
|Read Sect. 7.1-7.4 (pp. 234-249)||2/8|
|Read Sect. 7.5.3-7.5.4, 7.7-7.8 (pp. 256-259, 265-275)||2/11|
|Read Sect. 8.1-8.2.5 (pp. 285-295)||2/13|
|Read Sect. 8.2.6-8.2.8 (pp. 295-300)||2/15|
|Read Sect. 8.3-8.5 (pp. 300-313)||2/18|
|Read An Introduction to Prolog Programming by Ulle Endriss, Chapter 1 (pp. 1-12) and Sect. 6.1 (pp. 49-51)||2/20|
|Read Sect. 9.1-9.2 (pp. 322-329)||2/22|
|Read Sect. 9.4 (pp. 337-345)||2/25|
|Read Sect. 12.1-12.2, 12.5, 12.7-12.8 (pp. 437-445, 453-458, 462-468)||2/27|
|Read Sect. 10.1-10.2.1 (pp. 366-374)||3/6|
|Read Sect. 10.2.2-10.2.3 (pp. 374-379)||3/8|
|Read Sect. 10.3 (pp. 379-387)||3/20|
|Read Sect. 13.1-13.2 (pp. 480-490)||3/25|
|Read Sect. 13.3-13.7 (pp. 490-503)||3/27|
|Read Sect. 14.1 (pp. 510-513)||3/29|
|Read Sect. 14.2 (pp. 513-518)||4/1|
|Read Sect. 14.4 (pp. 522-530)||4/3|
|Read Sect. 15.1-15.3 (pp. 566-583)||4/5|
|Read Sect. 16.1-16.3 (pp. 610-621)||4/8|
|Read Sect. 18.1-18.2 (pp. 693-697)||4/10|
|Read Sect. 18.3 (pp. 697-707)||4/12|
|Read Sect. 18.4 (pp. 708-713)||4/15|
|Read Sect. 18.7.1-18.7.2 (pp. 727-731)||4/17|
|Read Sect. 18.7.3-18.7.5 (pp. 731-737)||4/19|
|Read Sect. 19.1 (pp. 768 - 776)||4/22|
|Read Sect. 18.9 (pp. 744 - 748)||4/24|
|Read Ch. 27 (pp. 1044 - 1052)||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.
- 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.
- 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.
- 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.
- 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.