Arne Meier

Hello, nice to have you here.

I am a professor at the Gottfried Wilhelm Leibniz Universität Hannover, Germany. I head the research group Algorithms. I obtained my Bachelor’s and Master’s Degrees in Computer Science as well as my PhD and Habilitation at Gottfried Wilhelm Leibniz Universität Hannover, Germany.

Argumentation: abstract as well as logic-based
Artificial Intelligence: logical foundations
Complexity Theory: algorithmic complexity, parameterised complexity
Enumeration: parameterised enumeration, enumeration complexity
Logic in Computer Science: non-classical, non-monotonic, team, temporal, hybrid, modal, default, and autoepistemic logic

[December 2024] Our paper «A SUBSET-SUM Characterisation of the A-Hierarchy» together with Jan Gutleben has been accepted at SOFSEM 2025.
[July 2024] Our paper «Rejection in Abstract Argumentation: Harder Than Acceptance?» together with Johannes Fichte, Markus Hecher, and Yasir Mahmood has been accepted at ECAI 2024.
[June 2024] Our paper «Counting Complexity for Reasoning in Abstract Argumentation» together with Johannes Fichte and Markus Hecher has been published at JAIR.
[April 2024] Our paper «Quantitative Claim-Centric Reasoning in Logic-Based Argumentation» together with Markus Hecher, Yasir Mahmood, and Johannes Schmidt has been accepted for publication at this years IJCAI’24.
[April 2024] The next FoIKS will take place in Hannover in 2026!
[Februrary 2024] Our paper «Parameterized complexity of weighted team definability» together with Juha Kontinen, Yasir Mahmood, and Heribert Vollmer has been published at Cambridge’s Mathematical Structures in Computer Science
[December 2023] Our paper «Submodel Enumeration for CTL Is Hard» together with Nicolas Fröhlich has been accepted for publication at next years AAAI’24. You can find a preprint at arXiv.

[DAAD] Anwendungen und Komplexität von Logiken in der Semiring-Team-Semantik

['24 − '25 ]
[DFG] Team Logics: New Bridges to Database Repairs

[05'23 − 06'26]

[DAAD] Descriptive Complexity of Parameterised Counting Classes

[01'18 − 12'19]
[DFG] Nonclassical logics: parametrised and enumeration complexity

[10'13 − 07'22]
[MWK] Innovation Plus: Komplexität von Algorithmen

[02'20 − 09'22]