Constraint Solving |
We are developing software, theory, and algorithms that can solve mathematical constraints consisting of non-linear equalities and inequalities, conjunctions, disjunctions, and logical quantifiers (∀ , ∃ ).
For example, we produce as the solution of the constraint x^{2}+y^{2}-1 <= 0 /\ 2y <= x^{2} :
We apply the constraint solving technology in several areas (e.g., verification of complex systems, computation of Lyapunov functions)
We offer a large range of thesis topic in the area for students with a background in computer science, control, or mathematics. According to the interest and background of the student the thesis can be done in an application-oriented context (e.g., concrete application studies), in a more theoretical/mathematical direction, or in the direction of software-development. The research is done in an international environment, for example, collaborating with a large project in Germany.
I will be happy to provide more information. Just contact me!
Below are examples of possible thesis topics. Many more topics can be agreed upon in individual consultation.
Constraint Solving |