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

Temporärer Umzug

Changed visitor address due to construction work: Room A522, Building 3403, (Appelstr. 11A 30167 Hanover)
Location

Prof. Dr. rer. nat. Arne Meier

Arne Meier Arne Meier © PicturePeople
Prof. Dr. rer. nat. Arne Meier
Arne Meier Arne Meier © PicturePeople
Prof. Dr. rer. nat. Arne Meier
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.
Image Image Image © TCS4F

Publications

  • Journal contributions
    First 1 2
  • Conference contributions
    First 1 2 3

    2010

    Meier, A & Schneider, T 2010, The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. in Proceedings of the 23rd International Workshop on Description Logics (DL 2010). 24th International Workshop on Description Logics, Waterloo, Ontario, Canada, 4 May 2010. <https://arxiv.org/abs/1001.4255>

    2009

    Beyersdorff, O, Meier, A, Thomas, M, Vollmer, H, Mundhenk, M & Schneider, T 2009, Model Checking CTL is Almost Always Inherently Sequential. in C Lutz & J-F Raskin (eds), TIME 2009, 16th International Symposium on Temporal Representation and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings. IEEE Computer Society, pp. 21-28. https://doi.org/10.1109/TIME.2009.12
    Meier, A, Mundhenk, M, Schneider, T, Thomas, M, Weber, V & Weiss, F 2009, The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. in R Královic & D Niwinski (eds), Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. vol. 5734, Lecture Notes in Computer Science, Springer, pp. 587-599. https://doi.org/10.1007/978-3-642-03816-750

    2008

    Beyersdorff, O, Meier, A, Thomas, M & Vollmer, H 2008, The Complexity of Reasoning for Fragments of Default Logic. in O Kullmann (ed.), Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. vol. 5584, Lecture Notes in Computer Science, Springer, pp. 51-64. https://doi.org/10.1007/978-3-642-02777-27
    Meier, A, Mundhenk, M, Thomas, M & Vollmer, H 2008, The Complexity of Satisfiability for Fragments of CTL and CTL*. in Proceedings of the Second Workshop on Reachability Problems in Computational Models (RP 2008). vol. 223, Electron. Notes Theor. Comput. Sci., pp. 201-213. https://doi.org/10.1016/j.entcs.2008.12.040

  • Technical reports
    First 1
  • Theses
    First 1

Last Change: 28.10.25 Print

Contact us
Contact