| Constraint Satisfaction Problems (HÜ) |
| Untertitel:This course is part of the module: Constraint Satisfaction Problems |
| DozentIn:Prof. Dr. Antoine Mottet |
| Veranstaltungstyp:Übung (Lehre) |
Beschreibung:| 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. |
|
| Ort:nicht angegeben |
| Semester:SoSe 24 |
| Veranstaltungsnummer:lv3003_s24 |
| ECTS-Kreditpunkte:3 |
| Weitere Informationen: |
Heimatinstitut: Theoretische Informatik (E-EXK6)
In Stud.IP angemeldete Teilnehmer: 1
|
Institut für Abwasserwirtschaft und Gewässerschutz
