Leibniz Universität Hannover Fakultät Fakultät für Elektrotechnik und Informatik
Kontakt
Institut für Theoretische Informatik
 
Institut für Theoretische Informatik Institut Personenverzeichnis
Arne Meier

PD Dr. rer. nat. habil. Arne Meier

© PicturePeople
PD Dr. rer. nat. habil. Arne Meier
Telefon
+49 511 762 19768
E-Mail
meierthi.uni-hannover.de
Adresse
Appelstraße 9a
30167 Hannover
Gebäude
3408
Raum
1612A
© PicturePeople
PD Dr. rer. nat. habil. Arne Meier
Telefon
+49 511 762 19768
E-Mail
meierthi.uni-hannover.de
Adresse
Appelstraße 9a
30167 Hannover
Gebäude
3408
Raum
1612A

Temporärer Umzug

Wegen Bauarbeiten geänderte Besucheradresse: Raum A522, Gebäude 3403, (Appelstr. 11A 30167 Hannover)
Raumfinder
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

Activities

Publications

  • Journal contributions
    1 2 Last

    Zeige Ergebnisse 1 - 20 von 28

    2024

    Fichte JK, Hecher M, Meier A. Counting Complexity for Reasoning in Abstract Argumentation. Journal of Artificial Intelligence Research. 2024 Jun 23;80:805–834. doi: 10.1613/jair.1.16210
    Fichte JK, Meier A, Schindler I. Strong Backdoors for Default Logic. ACM Transactions on Computational Logic. 2024 Jun 17;25(3):15. Epub 2024 Mär 30. doi: 10.1145/3655024
    Kontinen J, Mahmood Y, Meier A, Vollmer H. Parameterized complexity of weighted team definability. Mathematical Structures in Computer Science. 2024 Mai;34(5):375-389. Epub 2024 Feb 20. doi: 10.48550/arXiv.2302.00541, 10.1017/S0960129524000033

    2023

    Haak A, Meier A, Prakash O, Rao BVR. Parameterised Counting in Logspace. ALGORITHMICA. 2023 Okt;85(10):2923-2961. 10. Epub 2023 Apr 21. doi: 10.1007/s00453-023-01114-2
    Mahmood Y, Meier A, Schmidt J. Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework. ACM Trans. Comput. Log. 2023 Mai 10;24(3):26:1-26:25. 26. Epub 2023 Jan 31. doi: 10.1145/3582499

    2022

    Haak A, Meier A, Müller F, Vollmer H. Enumerating teams in first-order team logics. Annals of Pure and Applied Logic. 2022 Dez;173(10):103163. Epub 2022 Jun 14. doi: 10.1016/j.apal.2022.103163
    Kontinen J, Meier A, Mahmood Y. A parameterized view on the complexity of dependence and independence logic. J. Log. Comput. 2022 Dez;32(8):1624-1644. Epub 2022 Nov 14. doi: 10.1093/logcom/exac070
    Mahmood Y, Meier A. Parameterised complexity of model checking and satisfiability in propositional dependence logic. Annals of Mathematics and Artificial Intelligence. 2022 Mär;90(2-3):271-296. Epub 2021 Feb 27. doi: https://doi.org/10.48550/arXiv.1904.06107, https://doi.org/10.1007/s10472-021-09730-w

    2021

    Mahmood Y, Meier A, Schmidt J. Parameterized complexity of abduction in Schaefer's framework. J. Log. Comput. 2021 Jan;31(1):266-296. 1. Epub 2020 Dez 29. doi: 10.1093/logcom/exaa079

    2020

    Hella L, Kuusisto A, Meier A, Vollmer H. Satisfiability of modal inclusion logic: Lax and strict semantics. ACM Transactions on Computational Logic. 2020 Jan 10;21(1):1-18. 7. Epub 2019 Okt. doi: 10.1145/3356043
    Meier A. Incremental FPT delay. Algorithms. 2020 Mai 15;13(5):122. doi: 10.3390/A13050122

    2019

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

    2018

    Durand A, Hannula M, Kontinen J, Meier A, Virtema J. Approximation and dependence via multiteam semantics. Annals of Mathematics and Artificial Intelligence. 2018 Aug;83(3-4):297-320. Epub 2018 Jan 18. doi: 10.1007/s10472-017-9568-4

    2017

    Creignou N, Meier A, Müller JS, Schmidt J, Vollmer H. Paradigms for Parameterized Enumeration. Theory of Computing Systems. 2017 Mai 1;60(4):737-758. Epub 2016 Sep 13. doi: 10.1007/s00224-016-9702-4
    Luck M, Meier A, Schindler I. Parametrised complexity of satisfiability in temporal logic. ACM Transactions on Computational Logic. 2017 Jan;18(1):1. doi: 10.1145/3001835

    2015

    Meier A, Schindler I, Schmidt J, Thomas M, Vollmer H. On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 2015;54(5-6):685-710. doi: 10.1007/S00153-015-0435-X

    2013

    Meier A, Schneider T. Generalized satisfiability for the description logic ALC. Theor. Comput. Sci. 2013 Sep 23;505:55-73. doi: 10.1016/J.TCS.2013.02.009

  • Conference contributions
    1 2 Last

    Zeige Ergebnisse 1 - 20 von 37

    2024

    Fröhlich N, Meier A. Submodel Enumeration for CTL Is Hard. in Wooldridge M, Dy J, Natarajan S, Hrsg., AAAI Proceedings. AAAI Press/International Joint Conferences on Artificial Intelligence. 2024. S. 10517-10524. (Proceedings of the AAAI Conference on Artificial Intelligence; 9). doi: 10.48550/arXiv.2312.09868, 10.1609/aaai.v38i9.28921
    Hecher M, Mahmood Y, Meier A, Schmidt J. Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. in Larson K, Hrsg., Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024. 2024. S. 3404-3412. (IJCAI International Joint Conference on Artificial Intelligence).

    2023

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

    2022

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

    2021

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

    2020

    Mahmood Y, Meier A, Schmidt J. Parameterised Complexity of Abduction in Schaefer’s Framework. in Artemov S, Nerode A, Hrsg., Logical Foundations of Computer Science (LFCS 2020): International Symposium, LFCS 2020, Proceedings. Cham: Springer. 2020. S. 195-213. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Epub 2019 Dez 20. doi: 10.48550/arXiv.1906.00703, 10.1007/978-3-030-36755-8_13
    Mahmood Y, Meier A. Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. in Herzig A, Kontinen J, Hrsg., Foundations of Information and Knowledge Systems - 11th International Symposium, FoIKS 2020, Dortmund, Germany, February 17-21, 2020, Proceedings. Springer. 2020. S. 157-174. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-39951-1_10, 10.15488/12823

    2018

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

    2017

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

    2016

    Durand A, Hannula M, Kontinen J, Meier A, Virtema J. Approximation and Dependence via Multiteam Semantics. in Gyssens M, Simari G, Hrsg., Foundations of Information and Knowledge Systems: 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings. Cham: Springer. 2016. S. 271-291. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/s10472-017-9568-4, 10.1007/978-3-319-30024-5_15
    Fichte JK, Meier A, Schindler I. Strong Backdoors for Default Logic. in Le Berre D, Creignou N, Hrsg., Theory and Applications of Satisfiability Testing – SAT 2016 - 19th International Conference, Proceedings. Cham: Springer. 2016. S. 45-59. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Epub 2016 Jun 11. doi: 10.1007/978-3-319-40970-2_4
    Meier A, Ordyniak S, Sridharan R, Schindler I. Backdoors for Linear Temporal Logic. in Guo J, Hermelin D, Hrsg., 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark. Band 63. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. 2016. S. 23:1-23:17. 23. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.IPEC.2016.23

  • Technical reports

    Zeige Ergebnisse 1 - 10 von 10

    2024

    Fichte JK, Hecher M, Mahmood Y, Meier A. Rejection in Abstract Argumentation: Harder Than Acceptance? 2024. (CoRR). Epub 2024. doi: 10.48550/arXiv.2408.10683
    Gutleben J, Meier A. A SUBSET-SUM Characterisation of the A-Hierarchy. 2024. (CoRR). Epub 2024. doi: 10.48550/arXiv.2409.07996

    2018

    Meier A. Enumeration in Incremental FPT-Time. 2018 Apr 20. Epub 2018 Apr 20.

    2016

    Hella L, Kuusisto A, Meier A, Virtema J. Model Checking and Validity in Propositional and Modal Inclusion Logics. 2016. (CoRR).

    2015

    Krebs A, Meier A, Virtema J. Parallel Computational Tree Logic. 2015. (CoRR).

    2013

    Creignou N, Meier A, Müller JS, Schmidt J, Vollmer H. Paradigms for Parameterized Enumeration. 2013. (CoRR).
    Creignou N, Ktari R, Meier A, Müller JS, Olive F, Vollmer H. Parameterized Enumeration with Ordering. 2013.

    2012

    Meier A. Generalized Complexity of ALC Subsumption. 2012. (CoRR).

    2010

    Creignou N, Meier A, Thomas M, Vollmer H. The Complexity of Reasoning for Fragments of Autoepistemic Logic. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. 2010. (Dagstuhl Seminar Proceedings).
    Creignou N, Meier A, Thomas M, Vollmer H. The Complexity of Reasoning for Fragments of Autoepistemic Logic. 2010. (CoRR).

  • Theses

    Zeige Ergebnisse 1 - 2 von 2

    2020

    Meier A. Parametrised enumeration. Hannover: Leibniz Universität Hannover, 2020. 111 S. doi: 10.15488/9427

    2011

    Meier A. On the Complexity of Modal Logic Variants and their Fragments. Cuvillier, 2011.

Letzte Änderung: 04.09.24 Druckversion

So erreichen Sie uns
Kontakt