PD Dr. rer. nat. habil. Arne Meier
30167 Hannover
Temporärer Umzug
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.
Activities
-
PC Member
Current/Future Program Committes: AAAI 2023, STACS 2023, AAMAS2024, FoIKS 2024 (co-chair)
Past Program Committees: LCC 2019, AAAI 2021, IJCAI 2021 (distinguished PC), IJCAI 2022 (distinguished PC)
-
Reviewing
Conferences: TAMC'11, SAT'12, STACS'12, SAT'13, AiML'14, STACS'14, SAT'14, ICALP'14, STACS'15, FoSSaCS'15, STACS'16, MFCS'16, WoLLIC'16, STACS'17, STACS'18, SAT'18, CiE'18, CSL'18, CSR'19, STACS'20, ICALP'20, LoDE'20, STACS'21, AAAI'21, ICALP'21, IJCAI'21, ESA'21, CSL'21, LoDE'21, CSL'22, STOC'22, LICS'22, ESA'22, IJCAI'22, MFCS'22, IJCAI'23, LICS'23, SAT'23, JELIA'23, CSL'23, STACS'23, AAAI'23
-
Research Projects
Descriptive Complexity of Parameterised Counting ClassesNonclassical logics: parametrised and enumeration complexity
-
Member of Steering Committees
Speaker GI-Special Interest Group Complexity
STACS
Publications
-
Journal contributions
Zeige Ergebnisse 21 - 28 von 28
2012
Beyersdorff O, Meier A, Thomas M, Vollmer H. The complexity of reasoning for fragments of default logic. J. Log. Comput. 2012;22(3):587-604. doi: 10.1093/LOGCOM/EXQ061Creignou N, Meier A, Vollmer H, Thomas M. The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 2012;13(2):17:1-17:22. doi: 10.1145/2159531.2159539Meier A, Müller JS, 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)2011Beyersdorff 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.015Meier 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
Zeige Ergebnisse 21 - 36 von 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. S. 281-292 doi: 10.1007/978-3-662-48057-1_22Krebs 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. S. 140-149 doi: 10.1109/TIME.2015.11Krebs A, Meier A, Mundhenk M. The model checking fingerprints of CTL operators. in Grandi F, Lange M, Lomuscio A, Hrsg., 22nd International Symposium on Temporal Representation and Reasoning, TIME 2015, Kassel, Germany, September 23-25, 2015. IEEE Computer Society. 2015. S. 101-110. (CoRR). doi: 10.1109/TIME.2015.13Lü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. S. 59-68 doi: 10.1109/TIME.2015.9Lück M, Meier A, Schindler I. Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. in Dediu AH, Formenti E, Martín-Vide C, Truthe B, Hrsg., Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings. Band 8977. Springer. 2015. S. 549-560. (Lecture Notes in Computer Science). doi: 10.1007/978-3-319-15579-143
2013
Creignou N, Meier A, Müller JS, Schmidt J, Vollmer H. Paradigms for Parameterized Enumeration. in Chatterjee K, Sgall J, Hrsg., Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Springer Berlin Heidelberg. 2013. S. 290-301. (Lecture Notes in Computer Science (LNCS)). doi: 10.1007/978-3-642-40313-2_27Ebbing J, Hella L, Meier A, Müller JS, 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. S. 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. S. 261-278Meier 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. S. 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, Hrsg., Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings. Band 6648. Springer. 2011. S. 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, Hrsg., Theory and Applications of Satisfiability Testing: SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. Springer. 2010. S. 30-43. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-14186-75Meier 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 JF, Hrsg., TIME 2009, 16th International Symposium on Temporal Representation and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings. IEEE Computer Society. 2009. S. 21-28 doi: 10.1109/TIME.2009.12Meier 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, Hrsg., Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. Band 5734. Springer. 2009. S. 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, Hrsg., Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings. Band 5584. Springer. 2008. S. 51-64. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-02777-27Meier 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). Band 223. 2008. S. 201-213. (Electron. Notes Theor. Comput. Sci.). doi: 10.1016/j.entcs.2008.12.040
-
Technical reports
Zeige Ergebnisse 1 - 8 von 8
-
Theses
Zeige Ergebnisse 1 - 2 von 2