This course will be offered for the first time in the winter term 2025/26.
Contents
Many complex problems in practice can be reduced to constraint solving which facilitates the employment of well-optimized standardised tools. However, recognizing this potential when dealing with such complex problems is not straightforward. Furthermore, there are many properties to consider when identifying suitable solutions for a problem at hand. Selecting a suboptimal tool can substantially impact the performance. In this lecture, we cover various applications of constraint solving in practice, strategies to reduce those problems to different constraint solving problems, and state-of-the-art algorithms to solve such problems.
In particular, the course contains the following contents:
Advanced understanding of satisfiability problems
Advanced understanding of propositional logic
Advanced logics (e.g. constraint programming or SMT)
Advanced logical problems (e.g. model counting)
Application areas of constraint solving
Reduction of practical problems to logical problems
Further information about the course can be found in Stud.IP and TUconnect.