CSE 327 AI Theory and Practice, Spring 2018
Professor Jeff Heflin
TTh 1:10-2:25pm, Neville 002
Check here for updates regarding the course.
- 5/10/18 - I have posted the solutions to Homework #7. Your homeworks are graded and can be picked up in my office before 1pm today, or between 10am and noon on Friday. I'll bring the rest to return before the final on Monday.
- 5/3/18 - I have posted the study guide for the final exam. The exam will be on Monday, May 14, 12-3pm in Chandler-Ullmann 248.
- 4/19/18 - Office hour swap: The hours on Friday 4/20 from 10am-noon will be held by Prof. Heflin in Building C, Room 232. The hours on Monday 4/23 will be held by Xin on the 6th floor of Packard Lab. There will be no office hours on Thursday 4/26.
- 4/3/18 - I will be travelling Wednesday and Thursday. We will have a substitute lecture on Thursday, and my office hours for Thr. 4/5 are canceled. I will hold alternate office hours on Fri. 4/6 for 10-11:30am.
- 3/21/18 - Due to a conflict, my office hours on Thr., 3/22 will only be from 10-11am.
- 3/2/18 - I posted a study guide for the midterm.
- 3/1/18 - There are two typos on your homework, both on question 3. The first is the name of your file (which is minor), while the second is a redundant sentence in the description of the knowledge base. Please see the corrections here.
- 2/7/18 - I have posted Dr. Nam's slides from his lecture on Tuesday, as well as the usual supplemental slides I use when lecturing on Ch. 3. All slides are in this directory.
- 2/6/18 - There is a typo on Homework #1, problem #4: Your tree will be 9 levels deep, not 8.
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.
Prof. Heflin's office is Mountaintop Building C, Room 232. This building is the new home of the Computer Science and Engineering department, as described here.
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 Sect. 1.1-2.3 (pp. 1-46)||1/25|
|Read Sect. 2.4-2.5 (pp. 46-59)||1/30|
|Read Sect. 3.1-3.3 (pp. 64-81)||2/1|
|Read Sect. 3.4 (pp. 81-91)||2/6|
|Read Sect. 3.5-3.7 (pp. 92-109)||2/8|
|Read Sect. 5.1-5.2, 5.4, 5.7-5.9 (pp. 161-167, 171-176, 180-186)||2/13|
|Read Sect. 8.1-8.2 (pp. 285-300)||2/15|
|Read Sect. 8.3-8.5 (pp. 300-313)||2/20|
|Read An Introduction to Prolog Programming by Ulle Endriss, Chapter 1 (pp. 1-12) and Sect. 6.1 (pp. 63-65)||2/27|
|Read Sect. 9.1-9.4 (pp. 322-345)||3/1|
|Read Sect. 12.1-12.2, 12.5, 12.7-12.8 (pp. 437-445, 453-458, 462-468)||3/6|
|Read Sect. 10.1 (pp. 366-372)||3/20|
|Read Sect. 10.2 (pp. 373-379)||3/22|
|Read Sect. 10.3 (pp. 379-387)|
|Read Sect. 13.1-13.2 (pp. 480-490)||3/29|
|Read Sect. 13.3-13.7 (pp. 490-503)||4/3|
|Read Sect. 14.1-14.2 (pp. 510-518)||4/5|
|Read Sect. 14.4 (pp. 522-530)||4/12|
|Read Sect. 15.1-15.3, 16.1-16.3 (pp. 566-583,610-621)||4/17|
|Read Sect. 18.1-18.3 (pp. 693-707)||4/19|
|Read Sect. 18.6-18.7 (pp. 717-737)||4/27|
|Read Sect. 18.4, 18.8-18.9 (pp. 708-713, 737-748)||5/1|
|Read Ch. 27 (pp. 1044-1052)||5/3|
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.
- Sample Prolog programs
- These are the examples that were shown in class
- 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.
- 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.