Arne Meier
Arne Meier
Lecturer, Institute of Theoretical Computer Science, Leibniz Universität Hannover
Verified email at thi.uni-hannover.de - Homepage
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
452009
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
40*
Paradigms for parameterized enumeration
N Creignou, A Meier, JS Müller, J Schmidt, H Vollmer
International Symposium on Mathematical Foundations of Computer Science, 290-301, 2013
34*2013
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
312011
The complexity of propositional implication
O Beyersdorff, A Meier, M Thomas, H Vollmer
Information Processing Letters 109 (18), 1071-1077, 2009
302009
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
232018
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
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
212010
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
18*2019
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
172012
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
152018
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
142019
Probabilistic team semantics
A Durand, M Hannula, J Kontinen, A Meier, J Virtema
International Symposium on Foundations of Information and Knowledge Systems …, 2018
142018
A team based variant of CTL
A Krebs, A Meier, J Virtema
2015 22nd International Symposium on Temporal Representation and Reasoning …, 2015
142015
On the complexity of modal logic variants and their fragments
A Meier
Ph. D. thesis, Institut für Theoretische Informatik, Leibniz Universität …, 0
11*
Parameterised Enumeration for Modification Problems
N Creignou, R Ktari, A Meier, JS Müller, F Olive, H Vollmer
Algorithms 12 (9), 189, 2019
9*2019
Counting complexity for reasoning in abstract argumentation
JK Fichte, M Hecher, A Meier
Proceedings of the AAAI Conference on Artificial Intelligence 33, 2827-2834, 2019
92019
On the parameterized complexity of default logic and autoepistemic logic
A Meier, J Schmidt, M Thomas, H Vollmer
International Conference on Language and Automata Theory and Applications …, 2012
92012
Generalized satisfiability for the description logic ALC
A Meier, T Schneider
Theoretical Computer Science 505, 55-73, 2013
8*2013
Parameterized complexity of CTL
M Lück, A Meier, I Schindler
International Conference on Language and Automata Theory and Applications …, 2015
62015
The system can't perform the operation now. Try again later.
Articles 1–20