- E-Mail:
- anselm.haak@uni-paderborn.de
- Phone:
- +49 5251 60-6727
-
- Office Address:
-
Fürstenallee 11
33102 Paderborn - Room:
- F2.108
About Anselm Haak
My main research interests lie in the intersection of computer science and logic, as well as parameterized complexity and related topics.
Previously, I have worked on counting complexity, descriptive complexity, circuit complexity, parameterized complexity, first-order and second-order logics and team logics.
Here in Paderborn, I plan to work on the complexity of (counting) problems arising in description logics, hoping to get new insights by viewing them through the lense of parameterized and fine-grained complexity.
I’m also always interested in exciting new directions of research related to my fields of study.
Publications
Latest Publications
ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, in: 2026.
Why not? Developing ABox Abduction beyond Repairs
A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, ArXiv:2507.21955 (2025).
Why not? Developing ABox Abduction beyond Repairs
A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, in: L. Tendera, Y. Ibanez Garcia, P. Koopmann (Eds.), Proceedings of the 38th International Workshop on Description Logics - DL 2025, 2025.
Counting of Teams in First-Order Team Logics
A. Haak, J. Kontinen, F. Müller, H. Vollmer, F. Yang, ACM Transactions on Computational Logic (2025).
Solving Polynomial Equations Over Finite Fields
H. Dell, A. Haak, M. Kallmayer, L. Wennmann, in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, Philadelphia, PA, 2025.
Show all publications
Teaching
Current Courses
- Parameterized Algorithms and Complexity( in English)
Scientific Engagement
24.07.2026 | PC member of the workshop on Logical Approaches to Handling Inconsistent Data (LINDA)
PC member of the workshop on Logical Approaches to Handling Inconsistent Data (LINDA) (Link)
17.07.2026 - 19.07.2026 | PC member of the 39th International Workshop On Description Logics
PC member of the 39th International Workshop On Description Logics (Link)
03.09.2025 - 06.09.2025 | PC member of the 38th International Workshop On Description Logics
PC member of the 38th International Workshop On Description Logics (Link)