CS2710: Fall 2014


This schedule is subject to change.

Day Date Topics, Slides, Code Readings Assignment and Exam info
1 8/25 Introduction: intro.ppt R&N Chapters 1 & 2
2 8/27 State-Space Search chapter3part1.ppt

Figure 3.21
R&N Chapter 3.1-3.4
9/1 No Class
3 9/3 State-Space Search chapter3part2.ppt R&N Chapter 3.5
4 9/8 State-Space Search R&N Chapter 3.6
5 9/10 State-Space Search
6 9/15 Local Search and Optimization.
8queens.eps (Figure 4.6)
8queenspicture.eps (Figure 4.7)
R&N Chapter 4.1
7 9/17 Adversarial Search
the alpha-beta pruning mini-max algorithm
R&N Chapter 5.1-5.3 Assignment 1 due - EXTENDED to Monday 9/22.
The assignment is available here.
8 9/22 Constraint Satisfaction Problems slides
R&N Chapter 6.1-6.4 (except 6.3.3) Assignment 1 is due
9 9/24 Constraint Satisfaction (cont)
10 9/29 KR and Reasoning
R&N Chapters 7 and 8
11 10/1 KR and Reasoning
12 10/6 KR and Reasoning


Conversion to clausal form examples

(more clausal form egs; for reference; not required)

Resolution example

R&N Chapter 9 Assignment 2 due. The assignment has been posted on the TA's website.

13 10/8 Gaurav Trivedi (PhD student) will finishing covering the material in chapter9.ppt through Page 30.
14 TUES 10/14 Charmgil Hong (the TA; also a PhD student), will go over Assignment 3.

Assignment 3 is available here. Assignmnet 3 due at the beginning of class. Late assignments cannot be accepted.
15 10/15 Midterm
The midterm exam will cover the material covered in lecture through Tues Oct 14. This includes assignments 1-3 (the TA will go over Assignment 3 on Oct 14); and the lecture notes on the schedule through chapter9.ppt, page 30. The wrapup slides in the lecture notes identify the specific sections of the text you are responsible for. See the syllabus for a description of the types of questions.
16 10/20 Semi-decidability; thanks to Charles Elkan

Comparing backward chaining with resolution

17 10/22 From KR to Planning: the Situation Calculus sitcalc.ppt

In-class exercise solution.
Section 7.7 through 7.7.2; Section 10.4.2; Section 12.5.1
18 10/27
FYI: http://www.icaps-conference.org/

classicalPlanning.pdf: Planning intro slides


Results of (propositionalized) Partial-Order Planning using Astar search, where the h-value is the number of open conditions + the number of threats not yet resolved.

Please don't print these.

Chapter 10 through 10.3 (though read the rest of Chapter 10 for your interest)
19 10/29 Continued.
20 11/3

21 11/5 Begin Chapter 13, uncertainty.
22 11/10 Uncertainty lecch13.ppt: Slides for Chapter 13 (modified version of Hwee Tou Ng's slides on the AMIA website) R&N Chapter 13
23 11/12 Continued Continued Continued
24 11/17 Bayesian Belief Networks

bayesNetsPart1.pdf: Dr. Hauskrecht's Notes, Chapter 14, Part 1

chapter14part2.ppt: Second set of slides for Chapter 14
R&N: 14.1-2 Assignment 4 due.
Assignment writeup (assign4.pdf)
25 11/19 samplingAlgs.txt
chapter14part3.pdf Third set of slides for Chapter 14. Don't print these slides; they are animations. Extracted from Dr. Hauskrecht's notes (our thanks to him for formatting the animations). Most of this lecture will be one the board.
R&N: 14.5.1; plus, we will cover some ideas from 14.4.
26 11/24 learning.ppt: Learning

entropy.py.txt remove the "txt" to run it

The above materials were actually covered 11/19.

Here are the notes for today:


graphplan handout. I will bring copies of the handout, so there is no reason to print

R&N: Chapter 18 through 18.3.5
11/26 No Class No Class No Class
27 12/1
28 12/3 Review
The assignment is available here.
Assignment 5 due at the beginning of class.
Final Exam 12/8 Final Exam
12/10 No class No class