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.
Ahmed, Taha (2024). Development of an iterative multi-agent coordination framework for congestion prevention in low voltage grids.
Busch, Marcel (2024). Entwicklung eines Netzmodells zur szenarienbasierten Untersuchung von Engpässen in heutigen und zukünftigen städtischen Verteilnetzen.
Lindner, Joost (2024). Entwicklung einer probabilistischen Lastprognose für die Niederspannungsebene elektrischer Verteilnetze.
Möller, Julius (2024). Untersuchung von Kennzahlen zur Bewertung der Diskriminierungsfreiheit von Engpassmanagementmaßnahmen.
Wilke, Jan Jakob (2024). Definition leistungsbasierter Netzregeln zur Engpassvermeidung in elektrischen Verteilnetzen.
completed
2024
Ming, Zhao (2024). Conceptual Design for a grid demonstrator for teaching purposes and development of a suitable distribution grid simulation.
2023
Kock am Brink, Jonas (2023). Entwicklung einer Engpassprognose für elektrische Verteilnetze mittels probabilistischer Verfahren.