Handouts

Admin & Pointers

  1. Course Syllabus, our 'contract.'
  2. Guidelines
  3. Topics

Slides

  1. Temporal Reasoning
  2. Triangle-AC by Shant
  3. Tree Clutering by Chris (updated)
  4. Computing Cliques and Join Trees by Peter
  5. Interchangeability and Insterchange in Search (bundling) PS document, sorry
  6. Dynamic Bundling in CSPs
  7. Solutions Counting by Shant
  8. Theorem 5 of [Freuder AAAI91]
  9. Application in Geospatial Reasoning
  10. Path Consistency Algorithms by Peter and Wesley
  11. Tree Convex Constraints (PTTX) by Robert
  12. Rectangle Packing by Chris
  13. Covering Arrays by Pingyu
  14. Structure in SAT by Chris
  15. SAT and CP by Pingyu
  16. Basic Algebra for Symmetry by Robert

Scribe Minutes

  1. Robert's notes on Triangle-AC
  2. Pingyu's notes on Tree Clustering and max-cliques and join-tree identification in triangulated graphs
  3. Chris's notes on solution counting with the BTD
  4. Shant's notes on path consistency
  5. Peter's notes on tree convexity
  6. Robert's notes on optimal rectangle packing
  7. Wesley's notes on test covering)
  8. Shant's notes on structure in SAT
  9. Wesley's notes on comparing SAT and CP (Part I)
  10. Chris's notes on comparing SAT and CP (Part II) (part I)

Evaluation Forms

  1. Evaluate the Speaker
  2. Evaluate the Scribe

Papers

    Temporal Reasoning
  1. Triangle-AC by Choueiry and Xu, AI Communications, 2005.
  2. Triangle-STP by Xu and Choueiry, TIME 2003.
  3. TCSP by Xu and Choueiry, CP 2003.
  4. TCSP by Dechter, Meiri & Pearl, AIJ 1991.

    5. Row Convexity
  5. van Beek, P., and Dechter, R., "On The Minimality And Global Consistency Of Row-Convex Constraint Networks." Journal of the ACM, Vol. 42, No. 3, May 1995, pp. 543-561.
  6. Bessiere et al. "Making Bound Consistency as Effictive as Arc Consistency," IJCAI 2009, pages 425--430

    7. Tree Clustering
  7. Dechter, R. and Pearl, J. "Tree Clustering for Constraint Networks." Artificial Intelligence (38), 1989, pp. 353-366.

    8. Interchangeability
  8. Freuder, E.C. Eliminating Interchangeable Values in Constraint Satisfaction Problems, AAAI 2001
  9. Haselboeck: Exploiting Interchangeabilitie s in Constraint Satisfaction Problems, IJCAI 1993
  10. Choueiry and Davis: Dynamic Bundling: Less Effort for More Solutions, SARA 2002
  11. Lal et al.: Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs , AAAI 2005

    12. Solution Counting in BTD
  12. Favier et al. Exploiting Problem Structure for Solution Counting, CP 2009

    13. Geosptatial Reasoning
  13. Reformulating CSPs for Scalability with Application to Geospatial Reasoning, CP 2007

    14. Path Consistency
  14. P3C: A New Algorithm for the Simple Temporal Problem Planken et al., ICAPS 2008
  15. Triangle-STP , Xu and Choueiry, TIME 2003
  16. Path Consistency on Triangulated Constraint Graphs, Bliek and Sam-Haroud, IJCAI 1999

    17. Rectangle Packing
  17. Optimal Rectangle Packing: A Meta-CSP Approach, Moffitt and Pollack, AAAI 2006

    18. Test Covering
  18. Constraint Models for the Covering Test Problem, Hnich et al., Constraints 2006

    19. Structure in SAT
  19. Building Structure into Local Search for SAT, Pham et al., IJCAI 07
  20. Recovering and Exploiting Structural Knowledge from CNF Formulas, Ostrowski et al., CP 2002

    21. SAT and CP
  21. Propositional Satisfiability and Constraint Programming: A Comparative Survey, Bordeaux et al., ACM Computing Surverys 2006

    22. Residues in Lookahead During Search
  22. Maintaining Arc Consistency with Multiple Residues, Christophe Lecoutre et al., Constraint Programming Letters, 2008.
  23. A Study of Residual Supports in Arc Consistency, Christophe Lecoutre and Fred Hemery. Christophe Lecoutre and Fred Hemery, IJCAI 2007.
  24. Arc Consistency during Search, Likitvivatanavong et al., IJCAI 2007.
  25. An Optimal Coarse-Grained Arc Consistency Algorithm, Christian Bessiere et al. Artif. Intell. 165(2): 165-185 (2005).


Last modified: Mon Dec 21 14:00:44 CST 2009