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

PD Dr. rer. nat. habil. Arne Meier

© PicturePeople
PD Dr. rer. nat. habil. Arne Meier
Phone
+49 511 762 19768
Email
meierthi.uni-hannover.de
Address
Appelstraße 9a
30167 Hannover
Building
3408
Room
1612A
© PicturePeople
PD Dr. rer. nat. habil. 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

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
    First 1 2

    Showing results 21 - 26 out of 26

    2012

    Meier A, Müller J-S, Mundhenk M, Vollmer H. Complexity of Model Checking for Logics over Kripke models. Bull. EATCS. 2012;108:49-89.

    2011

    Beyersdorff O, Meier A, Mundhenk M, Schneider T, Thomas M, Vollmer H. Model Checking CTL is Almost Always Inherently Sequential. Log. Methods Comput. Sci. 2011;7(2). doi: 10.2168/LMCS-7(2:12)2011
    Beyersdorff O, Meier A, Müller S, Thomas M, Vollmer H. Proof complexity of propositional default logic. Arch. Math. Log. 2011;50(7-8):727-742. doi: 10.1007/S00153-011-0245-8

    2010

    Meier A, Mundhenk M, Schneider T, Thomas M, Weber V, Weiss F. The complexity of satisfiability for fragments of hybrid logic - Part I. IMA Journal of Applied Mathematics. 2010;8(4):409-421. doi: 10.1016/J.JAL.2010.08.001

    2009

    Beyersdorff O, Meier A, Thomas M, Vollmer H. The complexity of propositional implication. Information Processing Letters. 2009;109(18):1071-1077. doi: 10.1016/j.ipl.2009.06.015
    Meier A, Thomas M, Vollmer H, Mundhenk M. The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 2009;20(5):901-918. doi: 10.1016/j.entcs.2008.12.040, 10.1142/S0129054109006954, 10.1142/S012905411592001X

  • Conference contributions
    First 1 2

    Showing results 21 - 36 out of 36

    2015

    Hella L, Kuusisto A, Meier A, Vollmer H. Modal Inclusion Logic - Being Lax is Simpler than Being Strict. In Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings. 2015. p. 281-292 doi: 10.1007/978-3-662-48057-1_22
    Krebs A, Meier A, Virtema J. A Team Based Variant of CTL. In 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. 2015. p. 140-149 doi: 10.1109/TIME.2015.11
    Krebs A, Meier A, Mundhenk M. The model checking fingerprints of CTL operators. In Grandi F, Lange M, Lomuscio A, editors, 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. IEEE Computer Society. 2015. p. 101-110. (CoRR). doi: 10.1109/TIME.2015.13
    Lück M, Meier A. LTL Fragments are Hard for Standard Parameterisations. In 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. 2015. p. 59-68 doi: 10.1109/TIME.2015.9
    Lück M, Meier A, Schindler I. Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. In Dediu A-H, Formenti E, Martín-Vide C, Truthe B, editors, Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. Vol. 8977. Springer. 2015. p. 549-560. (Lecture Notes in Computer Science). doi: 10.1007/978-3-319-15579-143

    2013

    Creignou N, Meier A, Müller J-S, Schmidt J, Vollmer H. Paradigms for Parameterized Enumeration. In Chatterjee K, Sgall J, editors, Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Springer Berlin Heidelberg. 2013. p. 290-301. (Lecture Notes in Computer Science (LNCS)). doi: 10.1007/978-3-642-40313-2_27
    Ebbing J, Hella L, Meier A, Müller J-S, Virtema J, Vollmer H. Extended Modal Dependence Logic. In Logic, Language, Information, and Computation - 20th International Workshop, WoLLIC 2013, Darmstadt, Germany, August 20-23, 2013. Proceedings. 2013. p. 126-137 doi: 10.1007/978-3-642-39992-3_13

    2012

    Göller S, Meier A, Mundhenk M, Schneider T, Thomas M, Weiß F. The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. In Advances in Modal Logic 9, papers from the ninth conference on "Advances in Modal Logic," held in Copenhagen, Denmark, 22-25 August 2012. 2012. p. 261-278
    Meier A, Schmidt J, Thomas M, Vollmer H. On the Parameterized Complexity of Default Logic and Autoepistemic Logic. In Language and Automata Theory and Applications: 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings. 2012. p. 389-400 doi: 10.1007/978-3-642-28332-1_33

    2011

    Meier A, Schneider T. Generalized Satisfiability for the Description Logic ALC - (Extended Abstract). In Ogihara M, Tarui J, editors, Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings. Vol. 6648. Springer. 2011. p. 552-562. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-20877-553

    2010

    Beyersdorff O, Meier A, Müller S, Thomas M, Vollmer H. Proof Complexity of Propositional Default Logic. In Strichman O, Szeider S, editors, Theory and Applications of Satisfiability Testing: SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. Springer. 2010. p. 30-43. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-14186-75
    Meier A, Schneider T. The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. In Proceedings of the 23rd International Workshop on Description Logics (DL 2010). 2010

    2009

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

    2008

    Beyersdorff O, Meier A, Thomas M, Vollmer H. The Complexity of Reasoning for Fragments of Default Logic. In Kullmann O, editor, Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Vol. 5584. Springer. 2008. p. 51-64. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-02777-27
    Meier A, Mundhenk M, Thomas M, Vollmer H. 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. 2008. p. 201-213. (Electron. Notes Theor. Comput. Sci.). doi: 10.1016/j.entcs.2008.12.040

  • Technical reports

    Showing results 1 - 8 out of 8

  • Theses

    Showing results 1 - 2 out of 2

Last Change: 11.04.24 Print

Contact us
Contact