CSC2512 - Lectures slides and readings

Lecture	Date	Topic	Notes
1	Jan 13th	Introduction to the problem of SATisfability. Conversion to CNF. The DP algorithm.
2	Jan 20th	DPLL, types of Resolution, architecture of modern SAT solvers (the last was presented in class on the board, not on the slides)
3	Jan 27^th	Clause learning and other features of modern SAT solvers	Readings: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver, Zhang et al. International Conference on Computer-Aided Design, (ICCAD) 2001. To be presented: 1. On the Power of Clause-Learning SAT Solvers with Restarts. Pipatsrisawat & Darwiche, Principles and Practice of Constraint Programming (CP), 2009. 2. Empirical Study of the Anatomy of Modern Sat Solvers Restarts. Katebi et al. Theory and Applications of Satisfiability Testing (SAT) 2011. Slides from Paper presentation by Michalis Famelis 3. Adaptive Restart Control for Conict Driven SAT Solvers. Biere. Theory and Applications of Satisfiability Testing (SAT) 2008. Slides from paper presentation by Jan Gorzny
4	Feb 3^rd	CSPs
5	Feb 10^th	Enforcing GAC	Readings: 1. A Fast Arc Consistency Algorithm for n-ary Constraints. Olivier Lhomme and Jean-Charles Regin, Proceedings of the National Conference on Artificial Intelligence, 2005. (AAAI-2005) 2. A Filtering Algorithm for constraints of difference in CSPs. Jean-Charles Regin. Proceedings of the National Conference on Artificial Intelligence, 1994. (AAAI-1994) To be presented: 1. Data Structures for Generalised Arc Consistency for Extensional Constraints. Gent et al. Proceedings of the National Conference on Artificial Intelligence, 2007. (AAAI-2007) 2. Revisiting the Sequence Constraint. van Hoeve et al. Principles and Practice of Constraint Programming, 2006. (CP-2006)
6	Feb 17^th	Modeling CSP problems, and the connection between SAT and CSP	Readings: 1. Modelling Barbara M. Smith. In Francesca Rossi, Peter van Beek, and Toby Walsh, editors, Handbook of Constraint Programming, Chapter 11, pages 377-406. Elsevier, 2006. ISBN 0-444-52726-5 2. SAT v CSP Toby Walsh. Proceedings of CP-2000, pages 441-456, Springer-Verlag LNCS-1894, 2000. To be presented: 3. GAC via Unit Propagation Fahiem Bacchus. Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP-2007), 133-147.