Constraint Programming Winter School
Aperçu des sections
-
Généralités
-
If you continue to work on the labs and you have questions, you can push your code in the lab so we can access it and contact us:
- Hadrien: hadrien.cambazard@grenoble-inp.fr
- Arnaud: arnaud.malapert@univ-cotedazur.fr
- Charles: charles.prudhomme@imt-atlantique.fr
-
Constraint propagandaWe will spread the good word about constraint propagation and local consistencies. The former is the prime procedure to prune prohibitively large search trees in constraint programming. The latter is the formal notion used to describe what propagation does, irrespective of how it is done, and is essential to designing, analyzing and comparing constraint propagation algorithms. We will use several examples to introduce some relevant terminology as well as a few important principles, and hopefully persuade you of the significance of constraint propagation.
-
Quiz on local consistencies (AC, BC, Closure)
-
Recevoir une note Obtenir une note minimale de réussite
-
Consulter Recevoir une note Obtenir une note minimale de réussite
-
Recevoir une note Obtenir une note minimale de réussite
-
Recevoir une note Obtenir une note minimale de réussite
-
Correction of the Magic Series Quiz URL
-
Implementation of a Propagator