You may choose any programming language for implementation purposes, though bear in mind that efficiency is the central point of many of the algorithms we're going to study. Evaluate conflict-directed backjumping or dynamic backtracking with arc consistency, dynamic variable ordering, and forward checking. May 10, 2001. Evaluate Graphplan or use your satisfiability engine to implement Satplan. May 24, 2001.
Assignments are due by noon on the specified due date.
While you are strongly encouraged to turn in assignments on time, we do have a liberal late policy. For example, you may submit each assignment a day late, for a total of four late days, without any penalty. If you submit each assignment two days late, then the fourth assignment will be assessed a one day penalty. In any case, assignments will not be accepted more than 7 days after their due dates. . Reading list All papers in this reading list are included in the course reader available at the Stanford Bookstore.