Note that this is a tentative syllabus, subject to change at any time.
When: 1800-2130 (6:00-9:00PM) Thursdays
Where: Urban Center room 205 (remote classroom)
Who: Bart Massey <bart@cs.pdx.edu>
Office Hours:by e-mail appointment
CRN: 40656(410), 40671(510), 45542(OCATE)
This course explores methods for the solution of constraint satisfaction and related problems using search techniques, in the context of real-world problems such as resource-bounded scheduling, enterprise planning, classical planning, and one- and two-player games. The emphasis is on coding projects, and on reading and reporting on selected literature.
The course is, of necessity, an overview of the area: there is far more material here than can be thoroughly covered in the time available. A student project and presentation will provide an opportunity for focus on a particular topic of individual interest.
Each student will be expected to do all assigned reading, to present a paper in class, and to do several coding homework assignments culminating in a small final coding project.
In addition, graduate students will be expected to select, read, and present in class (all with my help) a paper of their choosing on a search-related topic.
This is a seminar-style course: I will attempt to substitute discussion for lecture to the extent that I find it feasible. It is important that students come to class prepared to discuss the material.
The required course text will be
An additional optional text,
Other papers will either be handed out in class or available on-line.
Other texts used in the course include:
There is one special e-mail address associated with the course. <cs510cs-discuss@cs.pdx.edu> is the course mailing list (using majordomo). Subscribe to this by sending an e-mail message to majordomo@cs.pdx.edu with subscribe cs510cs-discuss in the body, and use it for class discussions and the like. I will also announce important changes to the web page to this list.
Readings are for the week after the lecture, (but of course feel free to do them earlier).
| Date | Topics | Readings | HW |
|---|---|---|---|
| 1/11 | Introduction To Search | [Ginsberg-book] ch. 1, 2 (handout) | |
| 1/18 | Constraint Satisfaction Problems | [Tsang] ch. 1, 2 | HW 1a (due 1/31) |
| 1/25 | NP-Completeness [PS] [PDF] | [Garey-Johnson] ch. 1, 2 (handout) | |
| 2/1 | Good Complete Search Methods [PS] [PDF] | [Tsang] ch. 2.3, 5.1-5.2, 10.1-10.2.3, [Korf-CKK] | HW 1b (due 2/21) |
| 2/8 | Incomplete Search Methods and SAT [PS] [PDF] | [Tsang] ch. 8, [Gent-Walsh] | HW 1c (due 2/28) |
| 2/15 | Pathfinding Search, Adversary Search [PS] [PDF] | [Korf-book] ch. 3 (except 3.7.4-), ch. 7 | |
| 2/22 | More About CSPs, Search Software Engineering [PS] [PDF] | [Tsang] ch. 3-6 (where relevant) | |
| 3/1 | Planning and Scheduling [PS] [PDF] | [Gupta-Nau], [Minton-Johnston] |
Final Project (due
3/21) Final Presentation (in-class 3/15) |
| 3/8 | More About Planning And Scheduling | [PS] [PDF]TBA | |
| 3/15 | Student Presentations |