Pierre Schaus, Laurent Michel, Pascal Van Hentenryck. Module 1: From Backtracking Search to the Constraint Programming Paradigm Starting from a custom backtracking search algorithm for the N-Queens Problem, we will make the approach gradually more generic until the introduction of a purely declarative approach and the design a first tiny CP library. Module 2: Introduction to Mini-CP The design and internals (variables, domains, state restoration, etc.) of Mini-CP, the constraint programming library that is used along the course and that is extended in each assignment. Module 3: The sum and element global constraints Two constraints that occur for solving most of the CP problems.
Design of their filtering algorithms, study of their properties and implementation. Module 4: The extensional table constraint Introduction to the table constraint, the most generic one can imagine in CP. Study of some of its application, and filtering algorithms for this constraint. Pascal Van Hentenryck. Jimmy Ho Man Lee Peter Stuckey. Helmut Simonis. ECLiPSE ELearning Course by Helmut Simonis This is a self-study course on Constraint Programming using the ECLiPSe language, consisting of video lectures and accompanying material. Slides Handout Chapter 2: First Steps Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Slides Handout Chapter 17: Using Mixed Integer Linear Programming Slides Handout Chapter 18:A Hybrid Model Slides Handout Chapter 19:Comparing Technologies Slides Handout Chapter 20:Working with Implications Slides Handout ECLiPSe ELearning Course by Helmut Simonis is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 Unported License.
Online Learning Resources for Reasoning With Constraints chapter of Artificial Intelligence: Foundations of Computational Agents.