CSE 327 AI Theory and Practice, Spring 2018

Professor Jeff Heflin

TTh 1:10-2:25pm, Neville 002

Course News

Check here for updates regarding the course.

Course Description

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.

For details about course content, grading, and assignments, see the class syllabus.

Office Hours

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.

Mon.2-3:30pmMT Building C, Room 232Prof. Jeff Heflin
Tue.3-5pmPackard Lab 6th FloorXin Li (TA)
Thr.10-11:30amMT Building C, Room 232Prof. Jeff Heflin
Fri.10am-12pmPackard Lab 6th FloorXin Li (TA)

Homework Assignments

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

Additional Class Materials

Contains information on course content, grading, assignments, and office hours
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.