Leibniz Universität Hannover Faculty Faculty of Electrical Engineering and Computer Science
Deutsch Contact Deutsch
Theoretical Computer Science
 
Institute of Theoretical Computer Science Institute Staff Directory
Arne Meier

Prof. Dr. rer. nat. Arne Meier

© PicturePeople
Prof. Dr. rer. nat. Arne Meier
Phone
+49 511 762 19768
Email
meierthi.uni-hannover.de
Address
Appelstraße 9a
30167 Hannover
Building
3408
Room
1612A
© PicturePeople
Prof. Dr. rer. nat. Arne Meier
Phone
+49 511 762 19768
Email
meierthi.uni-hannover.de
Address
Appelstraße 9a
30167 Hannover
Building
3408
Room
1612A

Temporärer Umzug

Changed visitor address due to construction work: Room A522, Building 3403, (Appelstr. 11A 30167 Hanover)
Location
My area of expertise is complexity theory. Currently, I focus on the parameterised complexity of problems in non-classical logics with applications to AI. Furthermore, I study enumeration algorithms. I also enjoy typography and the text typesetting system LaTeX.

Interests

  • (Parameterised) Complexity Theory
  • Logic in Computer Science (particularly, non-classical logics)
  • Foundations of Artificial Intelligence
  • (Parameterised) Enumeration Algorithms
  • LaTeX (see my personal GitHub-Webside for a timeline LaTeX/TikZ package.
© TCS4F

Publications

  • Journal contributions
    1 2 Last

    Showing results 1 - 20 out of 30

    2025

    Hannula, M, Hirvonen, M, Kontinen, J, Mahmood, Y, Meier, A & Virtema, J 2025, 'Logics with probabilistic team semantics and the Boolean negation.', Journal of Logic and Computation, vol. 35, no. 3, 3. https://doi.org/10.1093/logcom/exaf021

    2024

    Fichte, JK, Hecher, M & Meier, A 2024, 'Counting Complexity for Reasoning in Abstract Argumentation', Journal of Artificial Intelligence Research, vol. 80, pp. 805–834. https://doi.org/10.1613/jair.1.16210
    Fichte, JK, Meier, A & Schindler, I 2024, 'Strong Backdoors for Default Logic', ACM Transactions on Computational Logic, vol. 25, no. 3, 15. https://doi.org/10.1145/3655024
    Kontinen, J, Mahmood, Y, Meier, A & Vollmer, H 2024, 'Parameterized complexity of weighted team definability', Mathematical Structures in Computer Science, vol. 34, no. 5, pp. 375-389. https://doi.org/10.1017/S0960129524000033, https://doi.org/10.48550/arXiv.2302.00541

    2023

    Haak, A, Meier, A, Prakash, O & Rao, BVR 2023, 'Parameterised Counting in Logspace', ALGORITHMICA, vol. 85, no. 10, 10, pp. 2923-2961. https://doi.org/10.1007/s00453-023-01114-2
    Mahmood, Y, Meier, A & Schmidt, J 2023, 'Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework', ACM Trans. Comput. Log., vol. 24, no. 3, 26, pp. 26:1-26:25. https://doi.org/10.1145/3582499

    2022

    Haak, A, Meier, A, Müller, F & Vollmer, H 2022, 'Enumerating teams in first-order team logics', Annals of Pure and Applied Logic, vol. 173, no. 10, 103163. https://doi.org/10.1016/j.apal.2022.103163
    Kontinen, J, Meier, A & Mahmood, Y 2022, 'A parameterized view on the complexity of dependence and dependence logic', J. Log. Comput., vol. 32, no. 8, pp. 1624-1644. https://doi.org/10.1093/logcom/exac070, https://doi.org/10.48550/arXiv.2109.09342
    Mahmood, Y & Meier, A 2022, 'Parameterised complexity of model checking and satisfiability in propositional dependence logic', Annals of Mathematics and Artificial Intelligence, vol. 90, no. 2-3, pp. 271-296. https://doi.org/10.48550/arXiv.1904.06107, https://doi.org/10.1007/s10472-021-09730-w

    2021

    Mahmood, Y, Meier, A & Schmidt, J 2021, 'Parameterized complexity of abduction in Schaefer's framework', J. Log. Comput., vol. 31, no. 1, 1, pp. 266-296. https://doi.org/10.1093/logcom/exaa079

    2020

    Hella, L, Kuusisto, A, Meier, A & Vollmer, H 2020, 'Satisfiability of modal inclusion logic: Lax and strict semantics', ACM Transactions on Computational Logic, vol. 21, no. 1, 7, pp. 1-18. https://doi.org/10.1145/3356043
    Meier, A 2020, 'Incremental FPT delay', Algorithms, vol. 13, no. 5, 122. https://doi.org/10.3390/A13050122

    2019

    Creignou, N, Ktari, R, Meier, A, Müller, JS, Olive, F & Vollmer, H 2019, 'Parameterised Enumeration for Modification Problems', Algorithms, vol. 12, no. 9, 9, pp. 189. https://doi.org/10.3390/a12090189, https://doi.org/10.15488/10960
    Hella, L, Kuusisto, A, Meier, A & Virtema, J 2019, 'Model checking and validity in propositional and modal inclusion logics', Journal of logic and computation, vol. 29, no. 5, pp. 605-630. https://doi.org/10.1093/logcom/exz008, https://doi.org/10.15488/3364
    Krebs, A, Meier, A & Mundhenk, M 2019, 'The model checking fingerprints of CTL operators', Acta informatica, vol. 56, no. 6, pp. 487-519. https://doi.org/10.48550/arXiv.1504.04708, https://doi.org/10.1007/s00236-018-0326-9
    Meier, A, Ordyniak, S, Ramanujan, MS & Schindler, I 2019, 'Backdoors for Linear Temporal Logic', ALGORITHMICA, vol. 81, no. 2, pp. 476-496. https://doi.org/10.1007/s00453-018-0515-5, https://doi.org/10.15488/1267

    2018

    Durand, A, Hannula, M, Kontinen, J, Meier, A & Virtema, J 2018, 'Approximation and dependence via multiteam semantics', Annals of Mathematics and Artificial Intelligence, vol. 83, no. 3-4, pp. 297-320. https://doi.org/10.1007/s10472-017-9568-4, https://doi.org/10.48550/arXiv.1510.09040

    2017

    Creignou, N, Meier, A, Müller, JS, Schmidt, J & Vollmer, H 2017, 'Paradigms for Parameterized Enumeration', Theory of Computing Systems, vol. 60, no. 4, pp. 737-758. https://doi.org/10.1007/s00224-016-9702-4
    Luck, M, Meier, A & Schindler, I 2017, 'Parametrised complexity of satisfiability in temporal logic', ACM Transactions on Computational Logic, vol. 18, no. 1, 1. https://doi.org/10.1145/3001835

    2015

    Meier, A, Schindler, I, Schmidt, J, Thomas, M & Vollmer, H 2015, 'On the parameterized complexity of non-monotonic logics.', Arch. Math. Log., vol. 54, no. 5-6, pp. 685-710. https://doi.org/10.1007/S00153-015-0435-X

  • Conference contributions
    1 2 Last

    Showing results 1 - 20 out of 39

    2025

    Gutleben, J & Meier, A 2025, A SUBSET-SUM Characterisation of the A-Hierarchy. in R Královič & V Kůrková (eds), SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 15539 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 31-44, 50th International Conference on Current Trends in Theory and Practice of Computer Science, Bratislava, Slovakia, 20 Jan 2025. https://doi.org/10.1007/978-3-031-82697-9_3, https://doi.org/10.48550/arXiv.2409.07996

    2024

    Fichte, JK, Hecher, M, Mahmood, Y & Meier, A 2024, Rejection in Abstract Argumentation: Harder Than Acceptance? in U Endriss, FS Melo, K Bach, A Bugarin-Diz, JM Alonso-Moral, S Barro & F Heintz (eds), ECAI 2024 - 27th European Conference on Artificial Intelligence, Including 13th Conference on Prestigious Applications of Intelligent Systems, PAIS 2024, Proceedings. Frontiers in Artificial Intelligence and Applications, vol. 392, IOS Press BV, pp. 3212-3219, 27th European Conference on Artificial Intelligence, ECAI 2024, Santiago de Compostela, Spain, 19 Oct 2024. https://doi.org/10.48550/arXiv.2408.10683, https://doi.org/10.3233/FAIA240867
    Hecher, M, Mahmood, Y, Meier, A & Schmidt, J 2024, Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. in K Larson (ed.), Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024. IJCAI International Joint Conference on Artificial Intelligence, pp. 3404-3412. <https://www.ijcai.org/proceedings/2024/377>

    2023

    Fichte, JK, Hecher, M, Mahmood, Y & Meier, A 2023, Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. in E Elkind (ed.), Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023. IJCAI International Joint Conference on Artificial Intelligence, vol. 2023-August, pp. 3212-3220. https://doi.org/10.24963/ijcai.2023/358
    Hannula, M, Hirvonen, M, Kontinen, J, Mahmood, Y, Meier, A & Virtema, J 2023, Logics with Probabilistic Team Semantics and the Boolean Negation. in S Gaggl, MV Martinez, M Ortiz & M Ortiz (eds), JELIA 2023: Logics in Artificial Intelligence. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14281 LNAI, Springer, Cham, pp. 665-680, JELIA 2023 - 18th Edition of the European Conference on Logics in Artificial Intelligence, Dresden, Germany, 20 Sept 2023. https://doi.org/10.48550/arXiv.2306.00420, https://doi.org/10.1007/978-3-031-43619-2_45

    2022

    Fröhlich, N & Meier, A 2022, Submodel Enumeration of Kripke Structures in Modal Logic. in D Fernandez-Duque, A Palmigiano, A Palmigiano & S Pinchinat (eds), AiML. Advances in Modal Logic, vol. 14, pp. 391-406.
    Gutsfeld, JO, Meier, A, Ohrem, C & Virtema, J 2022, Temporal Team Semantics Revisited. in LICS 22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science., 3533360, Association for Computing Machinery (ACM), New York, pp. 44:1-44:13. https://doi.org/10.1145/3531130.3533360
    Kontinen, J, Meier, A & Mahmood, Y 2022, A Parameterized View on the Complexity of Dependence Logic. in S Artemov & A Nerode (eds), Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings.. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13137 LNCS, Cham, pp. 125-142, International Symposium on Logical Foundations of Computer Science, LFCS 2020, Deerfield Beach, United States, 4 Jan 2020. https://doi.org/10.1007/978-3-030-93100-1_9

    2021

    Fichte, JK, Hecher, M, Mahmood, Y & Meier, A 2021, Decomposition-Guided Reductions for Argumentation and Treewidth. in Z-H Zhou (ed.), Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021.. IJCAI International Joint Conference on Artificial Intelligence, pp. 1880-1886, Thirty-Fifth AAAI Conference on Artificial Intelligence, 2 Feb 2021. https://doi.org/10.24963/ijcai.2021/259
    Fichte, JK, Hecher, M & Meier, A 2021, Knowledge-Base Degrees of Inconsistency - Complexity and Counting. in 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI-21 Technical Tracks, no. 7, vol. 35, pp. 6349-6357, Thirty-Fifth AAAI Conference on Artificial Intelligence, 2 Feb 2021. https://doi.org/10.1609/aaai.v35i7.16788
    Haak, A, Meier, A, Prakash, O & Rao, BVR 2021, Parameterised Counting in Logspace. in M Blaser & B Monmege (eds), 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021., 40, Leibniz International Proceedings in Informatics, LIPIcs, vol. 187, pp. 1-17, 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 16 Mar 2021. https://doi.org/10.48550/arXiv.1904.12156, https://doi.org/10.4230/LIPICS.STACS.2021.40
    Mahmood, Y, Meier, A & Schmidt, J 2021, Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. in 35th AAAI Conference on Artificial Intelligence, AAAI 2021. pp. 6426-6434. https://doi.org/10.1609/aaai.v35i7.16797

    2020

    Mahmood, Y, Meier, A & Schmidt, J 2020, Parameterised Complexity of Abduction in Schaefer’s Framework. in S Artemov & A Nerode (eds), Logical Foundations of Computer Science (LFCS 2020): International Symposium, LFCS 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11972 LNCS, Springer, Cham, pp. 195-213, International Symposium on Logical Foundations of Computer Science, LFCS 2020, Deerfield Beach, United States, 4 Jan 2020. https://doi.org/10.48550/arXiv.1906.00703, https://doi.org/10.1007/978-3-030-36755-8_13
    Mahmood, Y & Meier, A 2020, Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. in A Herzig & J Kontinen (eds), Foundations of Information and Knowledge Systems - 11th International Symposium, FoIKS 2020, Dortmund, Germany, February 17-21, 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12012 LNCS, Springer, pp. 157-174. https://doi.org/10.1007/978-3-030-39951-1_10, https://doi.org/10.15488/12823

    2019

    Fichte, JK, Hecher, M & Meier, A 2019, Counting complexity for reasoning in abstract argumentation. in AAAI-19, IAAI-19, EAAI-19 Proceedings. vol. 1, Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, AAAI Press/International Joint Conferences on Artificial Intelligence, pp. 2827-2834, 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Annual Conference on Innovative Applications of Artificial Intelligence, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, United States, 27 Jan 2019. https://doi.org/10.48550/arXiv.1811.11501, https://doi.org/10.1609/aaai.v33i01.33012827

    2018

    Durand, A, Hannula, M, Kontinen, J, Meier, A & Virtema, J 2018, Probabilistic team semantics. in S Woltran & F Ferrarotti (eds), Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10833 LNCS, Springer Verlag, pp. 186-206, 10th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2018, Budapest, Hungary, 14 May 2018. https://doi.org/10.1007/978-3-319-90050-6_11
    Krebs, A, Meier, A, Virtema, J & Zimmermann, M 2018, Team semantics for the specification and verification of hyperproperties. in I Potapov, J Worrell & P Spirakis (eds), 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018., 10, Leibniz International Proceedings in Informatics, LIPIcs, vol. 117, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, United Kingdom (UK), 27 Aug 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.10
    Meier, A & Reinbold, C 2018, Enumeration complexity of poor man’s propositional dependence logic. in S Woltran & F Ferrarotti (eds), Foundations of Information and Knowledge Systems: 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14–18, 2018, Proceedings. 1. edn, Lecture Notes in Computer Science (LNCS), vol. 10833, Information Systems and Applications, incl. Internet/Web, and HCI (LNISA), Springer Verlag, pp. 303-321, 10th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2018, Budapest, Hungary, 14 May 2018. https://doi.org/10.48550/arXiv.1704.03292, https://doi.org/10.1007/978-3-319-90050-6_17

    2017

    Hella, L, Kuusisto, A, Meier, A & Virtema, J 2017, Model checking and validity in propositional and modal inclusion logics. in KG Larsen, J-F Raskin & HL Bodlaender (eds), 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Leibniz International Proceedings in Informatics, LIPIcs, vol. 83, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aalborg, Denmark, 21 Aug 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.32

    2016

    Durand, A, Hannula, M, Kontinen, J, Meier, A & Virtema, J 2016, Approximation and Dependence via Multiteam Semantics. in M Gyssens & G Simari (eds), Foundations of Information and Knowledge Systems: 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9616, Springer, Cham, pp. 271-291. https://doi.org/10.1007/978-3-319-30024-5_15, https://doi.org/10.1007/s10472-017-9568-4

  • Technical reports

    Showing results 1 - 9 out of 9

    2025

    Barlag, T, Fröhlich, N, Hankala, T, Hannula, M, Hirvonen, M, Holzapfel, V, Kontinen, J, Meier, A & Strieker, L 2025 'Logic and Computation Through the Lens of Semirings'. https://doi.org/10.48550/arXiv.2502.12939

    2023

    Fröhlich, N, Meier, A, Pardal, N & Virtema, J 2023 'A logic-based framework for database repairs'. https://doi.org/10.48550/arXiv.2306.15516

    2018

    Meier, A 2018 'Enumeration in Incremental FPT-Time'. <https://arxiv.org/abs/1804.07799>

    2016

    Hella, L, Kuusisto, A, Meier, A & Virtema, J 2016 'Model Checking and Validity in Propositional and Modal Inclusion Logics' CoRR. <http://arxiv.org/abs/1609.06951>

    2015

    Krebs, A, Meier, A & Virtema, J 2015 'Parallel Computational Tree Logic.' CoRR. <https://dblp.org/db/journals/corr/corr1505.html#KrebsMV15>

    2013

    Creignou, N, Meier, A, Müller, J-S, Schmidt, J & Vollmer, H 2013 'Paradigms for Parameterized Enumeration' CoRR. <http://arxiv.org/abs/1306.2171>
    Creignou, N, Ktari, R, Meier, A, Müller, J-S, Olive, F & Vollmer, H 2013 'Parameterized Enumeration with Ordering.'. <https://dblp.org/rec/journals/corr/CreignouKMMOV13>

    2012

    Meier, A 2012 'Generalized Complexity of ALC Subsumption' CoRR. <https://dblp.org/db/journals/corr/corr1205.html#abs-1205-0722>

    2010

    Creignou, N, Meier, A, Thomas, M & Vollmer, H 2010 'The Complexity of Reasoning for Fragments of Autoepistemic Logic' Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. <http://drops.dagstuhl.de/opus/volltexte/2010/2523/>

  • Theses

    Showing results 1 - 2 out of 2

    2020

    Meier, A 2020, 'Parametrised enumeration', Doctor habilitatus, Leibniz University Hannover, Hannover. https://doi.org/10.15488/9427

    2011

    Meier, A 2011, 'On the Complexity of Modal Logic Variants and their Fragments'. <https://dblp.org/rec/books/daglib/0030205>

Last Change: 10.07.25 Print

Contact us
Contact