I am a PhD student at Saarland University. My supervisor is Prof. Dr. Jörg Hoffmann. Currently,
the focus of my research lies in methods akin to conflict-driven clause learning
for classical planning, and using planning algorithms for security related
analyses (such as automated network penetration testing).
Looking for something to read?
Delete Relaxation, Unchained: On Intractable Red-Black Planning and
Its Applications, D. Gnad, M. Steinmetz, M.
Jany, J. Hoffmann,
I. Serina, and A. Gerevini, Proceedings of the 9th Annual Symposium on
Combinatorial Search (SOCS'16), Tarrytown, NY, USA, 2016. (PDF)
Towards Clause-Learning State Space Search: Learning to Recognize
Dead-Ends, M. Steinmetz and J. Hoffmann,
Proceedings of the 30th AAAI Conference on Artificial
Intelligence (AAAI'16), Phoenix, USA, 2016. (PDF) (Technical Report)
Combining the Delete Relaxation with Critical-Path
Heuristics: A Direct Characterization,
M. Fickert, J.
Hoffmann, and M.
Journal of Artificial Intelligence Research,
Volume 56, 2016, pages 269-327. (PDF)