Constraint Programming
Solving complex decision problems (modelled with constraints) have undergone significant improvements in recent years, taking advantage of corresponding advances in constraint programming, both in finite (including Boolean) and continuous domains, namely through the search space reduction by means of constraint propagation.
This course addresses in more depth the topics of search referred to as elective in the ACM Computing Curriculum 2020 in the area of Intelligent Systems (items A, B and C).
