List of projects for 2011 will be available at a later date

Some papers are available from the Electronic Reserve of the Love Library (UNL access only) .

Instructor's slides

  1. Course Syllabus, our 'contract.'
  2. Instructor's slides: Administrative Note (PPT)
  3. Instructor's slides: Guidelines for reports (PPT)
  4. Instructor's slides:Constraint Processing 101 (PPT)
  5. Slides by Shant and Rahul: Quick review of NP-Completeness.
  6. Instructor's slides: Arc Consistency
  7. Instructor's slides: Odds & Ends (PPT)
  8. Instructor's slides: Backtracking mechanims (PPT)
  9. Instructor's slides: Theoretical Evaluation of BT Algorithms
  10. Instructor's slides: CSP & Relational DB
  11. Instructor's slides: Path Consistency & Global Consistency Properties
  12. Instructor's slides: Lookahead Schemas (PPT)
  13. Instructor's slides: Search Orders in CSPs (PPT)
  14. Instructor's slides: Least Commitement: Rationale and Strategy (PPT).
  15. Instructor's slides: A Consistency Algorithm for AllDifferent Constraint (PDF).
  16. Instructor's slides: Local Search (PPT).
  17. Instructor's slides: Advanced BT Search (PPT).
  18. Instructor's slides: Structure-Based Methods: An Introduction (PPT).
  19. Instructor's slides: More on Consistency Properties (PPT).

Basic Topics

Topic: Rules of the Game Required reading:
Topic: CSP 101, Overview Required reading: Recommended reading:
Topic: Arc Consistency Required reading: Recommended reading:
Topic: Backtrack Search Required reading: Recommended reading:
Topic: Continuation of CSP 101, Overview Required reading:
Topic: DB & CSP Required reading:
  • Section 1.3 of Dechter
Topic: Lookahead Schemas Required reading:
  • Dechter, Sections 5.3.1 and 5.3.2
Recommended reading:
  • The rest of Section 5.3 in Dechter.
Topic: Theoretical Evaluation of BT Algorithms Required reading: Recommended reading:
  • Dechter, Chapters 5 and 6
Topic: Evaluating & Comparing (Deterministic) BT Search Algorithms Required reading:
  • Dechter, Section 6.6
Recommended reading:
Topic: Basic Consistency Properties Required reading: Recommended reading:
Topic: An Efficient Propagator for the All-Diff Constraint Required reading: Recommended reading:
Topic: Search Orders in CSPs Required reading: Recommended reading:
Topic: Least Commitment
Topic: Local Search Required reading: Recommended reading:
  • Section 4.3, Chapter 4, AI a Modern Approach (textbook), Russell & Norvig
  • Stochastic Local Search (book), but Hoos and Stuelze

More Topics

Topic: Structure-Based Methods Required reading:
  • Dechter Sections: 2.1.3, 5.1.2, 10.1.1, 9.2, 4.4, 9.2.2.
Recommended reading:
Topic: Advanced Backtrack Search Required reading: Recommended reading:
Topic: Advanced Consistency Techniques Required reading:
  • Dechter, Sections 3.1, 3.2, 3.3, 3.4, 3.5.1, 3.5.3, 8.1
  • Dechter, Sections 2.1.3, 4.4, 10.1.1, 9.2, 9.2.2
Recommended reading:
Topic: Temporal Reasoning Required reading:
  • Dechter, Chapter 12
Recommended reading:
  • Koubarakis, CP Handbook, Chapter 19
  • Many papers in AAAI, IJCAI, CP, ICAPS, by Cesta, Oddi, van Beek, Golumbic & Shamir, Pollack, Tsamardinos, P. Morris, Planken et al., etc.
Topic: Binary vs Non-Binary CSPs: Mappings, FC
  • Instructor's slides: Binary vs. non-binary representations of constraint (ps, pdf).
  • Instructor's slides: Non-Binary FC.
Required reading: Recommended reading:
Topic: Interchangeability and Symmetry in CP
  • Instructor's slides: (PPT).
Required reading: Recommended reading: