Handouts

Electronic Reserves

(UNL access only) Some papers are available from the Electronic Reserve of the Love Library. In particular, you can find three chapters of the book by Edward Tsang: Chapter 1, Chapter 6, Chapter 5 Part 1 and Part 2.

Handouts

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. Constraint Programming: in Pursuit of the Holy Grail (POSTSCRIPT,PDF). Bartak
6. Instructor's slides: Backtracking mechanims (PPT)
7. Hybrid algorithms for the constraint satisfaction problem (PDF)--Prosser
8. Instructor's slides: Evaluating (deterministic) BT Search Algorithms (PPT)
9. Instructor's slides: Lookahead Schemas (PPT)
10. Instructor's slides: Overview: advanced solving techniques and research directions (PPT)
11. Slides by Shant and Rahul: Quick review of NP-Completeness (PS, PDF).
12. A Theorectical Evaluation of Selected Backtracking Algorithms (PDF, Electronic Reserve), by Kondrak and van Beek
13. Instructor's slides: A Theorectical Evaluation of Selected Backtracking Search (PPT)
14. Instructor's slides: Constraints & Relational Databases (PPT)
15. Instructor's slides: Consistency: Main Properties and Algorithms for Achieving them (PPT)
16. List of projects: PS, PDF
17. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems--Mackworth/Freuder
18. Instructor's slides: Search Orders in CSPs (PPT)
19. Ordering Heuristics in CSPs (PDF), Chapter 6, Tsang
20. Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems, Geelen (ECAI 92)
21. Fixing CBJ to find all solutions: pages 25-26 of Kondrak's MS thesis (PDF)
22. Instructor's slides: Note on the "least commitment" strategy.
23. Instructor's slides: Local Search (PPT slides).
24. Instructor's slides: Advanced Backtrack Search (PPT slides).
25. Instructor's slides: Consistency Algorithm for AllDifferent Constraints (PS, PDF).
26. Régin (AAAI 94): `A Filtering Algorithm for Constraints of Differences in CSPs'.
27. Instructor's slides: Binary vs. non-binary representations of constraint (ps, pdf).
28. Binary vs. non-binary representations of constraint-- Bacchus and van Beek, 98.
29. Instructor's slides: Non-Binary FC.
30. On Forward Checking for Non-Binary Constraint Satisfaction-- Bessiere, Meseguer, Freuder, and Larossa, AIJ 2002.
31. Instructor's slides: Tree-Based Methods (Decomposition).
32. Synthesizing constraint expressions, Freuder, JACM 1978
33. A sufficient condition for backtrack-free search, Freuder, JACM 1982
34. A sufficient condition for backtrack-bounded search, Freuder, JACM 1985
35. Tree Clustering for Constraint Networks Dechter and Pearl, AIJ
36. Papers for Dr. Jean-Charles Régin's lecture:
    Require reading:
    
    • Robust and Parallel Solving of a Network Design Problem ( PS, PDF).
    Recommended reading:
    Papers on modeling:
    • Minimizing the Number of Breaks in Sports Scheduling Problems Using Constraint Programming (PS, PDF).
    • Constraint Programming in OPL (PS, PDF).
    Chapter on Global Constraints:
    • Global Constraints and Filtering Algorithms (PS, PDF).
37. Regin's slides: Network Design, CP Challenges, and Principles of CP (CSE Colloquium).
38. Suzette'slides on Choco: Choco: a Constraint Programming Sysmtem (PPTX).
39. Choco documentation:
    • User Guide.
    • Laburthe's paper Implementing a CP Kernel (PDF). In CP'00 Post Conference Workshop on Techniques for Implementing Constraint programming Systems - TRICS. Pages 71--85. Singapour, 2000.

Last modified: Wed Apr 30 13:44:30 CDT 2008