Fahiem Bacchus

Tutorial Material

Constraint Satisfaction Problems

1. Here are the lecture notes that I use in my graduate course on constraints. The approach used is to present algorithms for constraint satisfaction problems from the unified point of view of nogood processing. The notes contain a detailed development of all of the popular backtracking CSP algorithms.
   Warning. I no longer teach my course using these notes. Although they are correct, they develop things is a more tedious manner than is optimal. My view of backtracking as doing resolution become clearer to me, and I now present things in a simpler manner using this relationship.
2. A basic introduction to some of the ideas of Constraint Satisfaction Problems, for high school students, Presented to Computing Insights class Summer 2000.
3. Tutorial on Sat and its relationship to CSPs. Presented at CP2005. (in 4up format).

Planning

1. Overview of AI Planning F. Bacchus, Presented at the Dagstuhl Seminar on Exploration of Large State Spaces 2001. (Unfortunately the colour scheme used in these slides makes them impossible to print, they can be viewed on-line however).
2. Control Intensive Planning F. Bacchus, Presented at the Planet International Summer School on AI Planning 2003

 Back to my home page.