| Date | Notes | Topic | Reading 3e | Reading 2e | Homework |
|---|---|---|---|---|---|
| 9/7 | 
| Introduction | 1.1-2.5 | 1.1-2.5 | |
| 9/12 |
| Problem solving as search | 3.1-3.4 | 3.1-3.5 | |
| 9/14 |
| Heuristic search | 3.5-3.6 | 4.1-4.2 | HW#1 due 9/21 PA#1 due 10/5 |
| 9/19 |
| Beyond classical search | 4.1, 4.3 | 4.3 (*) | |
| 9/21 |
| Constraint satisfaction | 6.1-6.2 | 5.1-5.2 | |
| 9/26 |
| Constraint satisfaction cont. | 6.3-6.5 | 5.3-5.5 | |
| 9/28 |
| Abstraction and multi-level search | | | |
| 10/3 |
| Adversarial search and game playing | 5.1-5.4 | 6.1-6.4 | HW#2 due 10/11 |
| 10/5 |
| Logical agents and propositional logic | 7.1-7.4 | 7.1-7.4 | |
| 10/11 |
| Inference in propositional logic | 7.5-7.7 | 7.5-7.7 | PA#2 due 11/7 |
| 10/12 |
| First-order logic | 8.1-8.3 | 8.1-8.3 | |
| 10/17 |
| Inference in first-order logic | 9.1-9.5 | 9.1-9.5 | HW#3 due 10/24 |
| 10/19 |
| Uncertainty | 13.1-13.6 | 13.1-13.6 | |
| 10/24 |
| Bayesian networks | 14.1-14.3 | 14.1-14.3 | |
| 10/26 |
| Exact inference in Bayesian networks | 14.4 | 14.4 | |
| 10/31 |
| Review for midterm | | | |
| 11/2 |
| Midterm exam | | | |
| 11/7 |
| Approximate inference in BNs and RPMs | 14.5-14.6 | 14.5-14.6 | HW#4 due 11/14 |
| 11/9 |
| Sequential decision making | 17.1-17.4 | 17.1-17.4 | |
| 11/14 |
| Reinforcement learning | 21.1-21.6 | 21.1-21.6 | PA#3 due 12/5 |
| 11/16 | | No Class - Friday Class Schedule | | | |
| 11/21 | | No Class - Thanksgiving Break | | | |
| 11/23 | | No Class - Thanksgiving Break | | | |
| 11/28 |
| Making rational decisions | 16.1-16.4 | 16.1-16.4 | |
| 11/30 |
| Decision networks & value of information | 16.5-16.7 | 16.5-16.7 | |
| 12/5 |
| Classical planning | 10.1-10.2 | 11.1-11.2 | HW#5 due 12/12 |
| 12/7 |
| Planning continued | 10.3-10.4 | 11.3-11.4 (*) | |
| 12/12 |
| Resource-bounded reasoning techniques | | | |
| 12/14 |
| Summary and review | | | |
| 12/19 |
| Final exam - 3:30 - 5:30, ILC S211 | | | |