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.

Research Interests (alphabetical order)

• 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

News

• [June 2026] Our paper «Parameterised Complexity of Consistent Query Answering via Graph Representations» together with Miika Hannula, Teemu Hankala, and Yasir Mahmood accepted at ICDT 2027.
• [May 2026] Our paper «Complexity of Logics with Semiring Semantics» together with Timon Barlag, Nicolas Fröhlich, Teemu Hankala, Miika Hannula, Minna Hirvonen, Vivian Holzapfel, Juha Kontinen, and Laura Strieker accepted at KR 2026.
• [May 2026] Our paper «Representation Theorems for Cumulative Propositional Dependence Logics» together with Juha Kontinen and Kai Sauerwald accepted at KR 2026.
• [May 2026] Our paper «A Circuit-Theoretic View of FO over Semirings» together with Timon Barlag, Nicolas Fröhlich, Teemu Hankala, Miika Hannula, Minna Hirvonen, Vivian Holzapfel, Juha Kontinen, and Laura Strieker accepted at WoLLIC 2026.

Recent Papers

1. 2026 Disjunctions of Two Dependence Atoms — 34th EACSL Annual Conference on Computer Science Logic (CSL 2026)
2. 2026 When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames — Foundations of Information and Knowledge Systems (FoIKS 2026)
3. 2025 Facets in Argumentation: A Formal Approach to Argument Significance — Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2025)
4. 2025 A Logic-Based Framework for Database Repairs — 22nd International Conference on Principles of Knowledge Representation and Reasoning (KR 2025)
5. 2025 On the Complexity and Properties of Preferential Propositional Dependence Logic — 22nd International Conference on Principles of Knowledge Representation and Reasoning (KR 2025)

View all publications →

Projects

Active

• [RSE-DAAD] Fine-grained complexity classification of CQA

  ['26 − '27]
• [DFG] Team Logics: New Bridges to Database Repairs

  [05'23 − 06'26]

Finished

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

  ['24 − '25]
• [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]

Powered by Jekyll and Minimal Light theme.