Arne Meier

Cited by

	All	Since 2019
Citations	765	447
h-index	17	12
i10-index	25	15

200820092010201120122013201420152016201720182019202020212022202320242 9 18 20 35 23 30 48 25 42 52 69 64 51 84 89 90

Public access

View all

32 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Jonni VirtemaLecturer, University of Sheffield, UKVerified email at sheffield.ac.uk
Juha KontinenProfessor, University of Helsinki, FinlandVerified email at helsinki.fi
Yasir MahmoodDICE Group, Paderborn UnoversityVerified email at uni-paderborn.de
Johannes SchmidtAssistent ProfessorVerified email at ju.se
Markus HecherMITVerified email at mit.edu
Johannes K. FichteLinköping UniversityVerified email at liu.se
Thomas SchneiderDept. of Mathematics and Computer Science, University of Bremen, GermanyVerified email at uni-bremen.de
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyVerified email at uni-jena.de
Lauri HellaMatematiikan professori, Tampereen yliopistoVerified email at uta.fi
Miika HannulaUniversity of HelsinkiVerified email at helsinki.fi
Antti KuusistoAcademy Research Fellow, Tampere UniversityVerified email at tuni.fi
Martin ZimmermannAalborg UniversityVerified email at cs.aau.dk
Raida KTARIAssistant Professor in computer science, Sfax universityVerified email at isims.usf.tn
Sebastian OrdyniakUniversity of LeedsVerified email at sheffield.ac.uk
Anselm HaakUniversität PaderbornVerified email at uni-paderborn.de
Ramanujan M. S.University of Warwick, UKVerified email at warwick.ac.uk
Christian ReinboldChair of Computer Graphics and Visualization, Technical University of MunichVerified email at tum.de
Om PrakashIndian Institute of Technology MadrasVerified email at smail.iitm.ac.in
Raghavendra Rao B VIIT MadrasVerified email at cse.iitm.ac.in

Arne Meier

Privatdozent, Institute of Theoretical Computer Science, Leibniz Universität Hannover

Verified email at thi.uni-hannover.de - Homepage

AI Complexity Theory Logic in Computer Science Parameterized Complexity Enumeration


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The complexity of satisfiability for fragments of CTL and CTL⋆ A Meier, M Thomas, H Vollmer, M Mundhenk International Journal of Foundations of Computer Science 20 (05), 901-918, 2009	59	2009
Paradigms for parameterized enumeration N Creignou, A Meier, JS Müller, J Schmidt, H Vollmer Theory of Computing Systems 60, 737-758, 2017	58	2017
Approximation and dependence via multiteam semantics A Durand, M Hannula, J Kontinen, A Meier, J Virtema Annals of Mathematics and Artificial Intelligence 83 (3-4), 297-320, 2018	49	2018
Extended Modal Dependence Logic EMDL⋆ J Ebbing, L Hella, A Meier, JS Müller, J Virtema, H Vollmer Logic, Language, Information, and Computation, 126, 0	46*
Team Semantics for the Specification and Verification of Hyperproperties A Krebs, A Meier, J Virtema, M Zimmermann LIPIcs-Leibniz International Proceedings in Informatics 117, 2018	44	2018
Probabilistic team semantics A Durand, M Hannula, J Kontinen, A Meier, J Virtema Foundations of Information and Knowledge Systems: 10th International …, 2018	44	2018
The complexity of reasoning for fragments of default logic O Beyersdorff, A Meier, M Thomas, H Vollmer Journal of Logic and Computation 22 (3), 587-604, 2011	32	2011
The complexity of propositional implication O Beyersdorff, A Meier, M Thomas, H Vollmer Information Processing Letters 109 (18), 1071-1077, 2009	32	2009
Counting Complexity for Reasoning in Abstract Argumentation JK Fichte, M Hecher, A Meier Journal of Artificial Intelligence Research 80, 805–834-805–834, 2024	29*	2024
Parameterised Enumeration for Modification Problems N Creignou, R Ktari, A Meier, JS Müller, F Olive, H Vollmer Algorithms 12 (9), 189, 2019	24*	2019
Model checking and validity in propositional and modal inclusion logics L Hella, A Kuusisto, A Meier, J Virtema Journal of Logic and Computation 29 (5), 605-630, 2019	24	2019
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics L Hella, A Kuusisto, A Meier, H Vollmer ACM Transactions on Computational Logic (TOCL) 21 (1), 7, 2019	23*	2019
Model Checking CTL is Almost Always Inherently Sequential H Vollmer, M Thomas, T Schneider, M Mundhenk, A Meier, O Beyersdorff Logical Methods in Computer Science 7, 2011	22*	2011
A team based variant of CTL A Krebs, A Meier, J Virtema 2015 22nd International Symposium on Temporal Representation and Reasoning …, 2015	21	2015
The complexity of satisfiability for fragments of hybrid logic--Part I A Meier, M Mundhenk, T Schneider, M Thomas, V Weber, F Weiss Journal of Applied Logic 8 (4), 409-421, 2010	21	2010
The complexity of reasoning for fragments of autoepistemic logic N Creignou, A Meier, H Vollmer, M Thomas ACM Transactions on Computational Logic (TOCL) 13 (2), 1-22, 2012	18	2012
On the parameterized complexity of non-monotonic logics A Meier, I Schindler, J Schmidt, M Thomas, H Vollmer Archive for mathematical logic 54 (5), 685-710, 2015	17*	2015
Parametrised complexity of satisfiability in temporal logic M Lück, A Meier, I Schindler ACM Transactions on Computational Logic (TOCL) 18 (1), 1-32, 2017	16*	2017
Temporal Team Semantics Revisited JO Gutsfeld, A Meier, C Ohrem, J Virtema Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022	14	2022
Decomposition-Guided Reductions for Argumentation and Treewidth. JK Fichte, M Hecher, Y Mahmood, A Meier IJCAI 21, 1880-1886, 2021	13	2021

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors