Obserwuj
Arne Meier
Arne Meier
Privatdozent, Institute of Theoretical Computer Science, Leibniz Universität Hannover
Zweryfikowany adres z thi.uni-hannover.de - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
582009
Paradigms for parameterized enumeration
N Creignou, A Meier, JS Müller, J Schmidt, H Vollmer
Theory of Computing Systems 60, 737-758, 2017
552017
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
472018
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
44*
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
422018
Probabilistic team semantics
A Durand, M Hannula, J Kontinen, A Meier, J Virtema
Foundations of Information and Knowledge Systems: 10th International …, 2018
422018
The complexity of propositional implication
O Beyersdorff, A Meier, M Thomas, H Vollmer
Information Processing Letters 109 (18), 1071-1077, 2009
322009
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
Counting Complexity for Reasoning in Abstract Argumentation
JK Fichte, M Hecher, A Meier
Journal of Artificial Intelligence Research 80, 805–834-805–834, 2024
26*2024
Parameterised Enumeration for Modification Problems
N Creignou, R Ktari, A Meier, JS Müller, F Olive, H Vollmer
Algorithms 12 (9), 189, 2019
23*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
232019
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
22*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
212015
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
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
182012
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
Enumeration complexity of poor man’s propositional dependence logic
A Meier, C Reinbold
International Symposium on Foundations of Information and Knowledge Systems …, 2018
132018
On the complexity of modal logic variants and their fragments
A Meier
Ph. D. thesis, Institut für Theoretische Informatik, Leibniz Universität …, 0
13*
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20