| Constraint Satisfaction Problems (HÜ) |
| Subtitle: |
| This course is part of the module: Constraint Satisfaction Problems |
| Semester: |
| SoSe 24 |
| Course type: |
| Exercise |
| Course number: |
| lv3003_s24 |
| Lecturer: |
| Prof. Dr. Antoine Mottet |
| Description: |
| This course gives an introduction to the topic of constraint satisfaction problems and their complexity. It will cover the basics of the theory such as the universal-algebraic approach to constraint satisfaction and several classical algorithms such as local consistency checking and the Bulatov-Dalmau algorithm. We will finally discuss the recent research directions in the field.Educational Objectives: After taking part successfully, students have reached the following learning results Professional Competence:- Knowledge:* Students can describe basic concepts from the theory of constraint satisfaction such as primitive positive formulas, interpretations, polymorphisms, clones* Students can discuss the connections between these concepts* Students know proofs strategies and can reproduce them- Skills:* Students can use CSPs to model problems fromcomplexity theory and decide their complexity using methods from the course. |
|
| Performance accreditation: |
| m1812-2021 - Constraint Satisfaction Problems<ul><li>p1803-2021 - Constraint Satisfaction Problems: mündlich</li></ul> |
| ECTS credit points: |
| 3 |
| Stud.IP informationen about this course: |
Home institute: Theoretische Informatik (E-EXK6)
Registered participants in Stud.IP: 1
|
