Arne Meier

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 54

Top Venues

Publications

Nicolas Fröhlich, Arne Meier
Submodel Enumeration for CTL Is Hard. AAAI (2024)
Johannes Klaus Fichte, Markus Hecher, Arne Meier
Counting Complexity for Reasoning in Abstract Argumentation. J. Artif. Intell. Res. 80 (2024)
Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema
Logics with Probabilistic Team Semantics and the Boolean Negation. JELIA (2023)
Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema
Logics with probabilistic team semantics and the Boolean negation. CoRR (2023)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework. ACM Trans. Comput. Log. 24 (3) (2023)
Nicolas Fröhlich, Arne Meier
Submodel Enumeration for CTL Is Hard. CoRR (2023)
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. IJCAI (2023)
Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer
Parameterized Complexity of Weighted Team Definability. CoRR (2023)
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
Parameterised Counting in Logspace. Algorithmica 85 (10) (2023)
Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
Enumerating teams in first-order team logics. Ann. Pure Appl. Log. 173 (10) (2022)
Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema
Temporal Team Semantics Revisited. LICS (2022)
Yasir Mahmood, Arne Meier
Parameterised complexity of model checking and satisfiability in propositional dependence logic. Ann. Math. Artif. Intell. 90 (2) (2022)
Juha Kontinen, Arne Meier, Yasir Mahmood
A Parameterized View on the Complexity of Dependence Logic. LFCS (2022)
Nicolas Fröhlich, Arne Meier
Submodel Enumeration of Kripke Structures in Modal Logic. AiML (2022)
Juha Kontinen, Arne Meier, Yasir Mahmood
A parameterized view on the complexity of dependence and independence logic. J. Log. Comput. 32 (8) (2022)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. CoRR (2021)
Juha Kontinen, Arne Meier, Yasir Mahmood
A Parameterized View on the Complexity of Dependence Logic. CoRR (2021)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterized complexity of abduction in Schaefer's framework. J. Log. Comput. 31 (1) (2021)
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
Decomposition-Guided Reductions for Argumentation and Treewidth. IJCAI (2021)
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
Parameterised Counting in Logspace. STACS (2021)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. AAAI (2021)
Johannes Klaus Fichte, Markus Hecher, Arne Meier
Knowledge-Base Degrees of Inconsistency: Complexity and Counting. AAAI (2021)
Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema
Temporal Team Semantics Revisited. CoRR (2021)
Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
Enumerating Teams in First-Order Team Logics. CoRR (2020)
Yasir Mahmood, Arne Meier
Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. FoIKS (2020)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. 21 (1) (2020)
Arne Meier
Incremental FPT Delay. Algorithms 13 (5) (2020)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterised Complexity of Abduction in Schaefer's Framework. LFCS (2020)
Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
Model checking and validity in propositional and modal inclusion logics. J. Log. Comput. 29 (5) (2019)
Yasir Mahmood, Arne Meier
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. CoRR (2019)
Johannes Klaus Fichte, Markus Hecher, Arne Meier
Counting Complexity for Reasoning in Abstract Argumentation. AAAI (2019)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterised Complexity for Abduction. CoRR (2019)
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
Parameterised Enumeration for Modification Problems. Algorithms 12 (9) (2019)
Andreas Krebs, Arne Meier, Martin Mundhenk
The model checking fingerprints of CTL operators. Acta Informatica 56 (6) (2019)
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
Parameterised Counting Classes with Bounded Nondeterminism. CoRR (2019)
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
Backdoors for Linear Temporal Logic. Algorithmica 81 (2) (2019)
Johannes Klaus Fichte, Markus Hecher, Arne Meier
Counting Complexity for Reasoning in Abstract Argumentation. CoRR (2018)
Arne Meier
Enumeration in Incremental FPT-Time. CoRR (2018)
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
Probabilistic team semantics. CoRR (2018)
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
Probabilistic Team Semantics. FoIKS (2018)
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83 (3-4) (2018)
Arne Meier, Christian Reinbold
Enumeration Complexity of Poor Man's Propositional Dependence Logic. FoIKS (2018)
Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
Team Semantics for the Specification and Verification of Hyperproperties. MFCS (2018)
Arne Meier, Christian Reinbold
Enumeration Complexity of Poor Man's Propositional Dependence Logic. CoRR (2017)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60 (4) (2017)
Martin Lück, Arne Meier, Irena Schindler
Parametrised Complexity of Satisfiability in Temporal Logic. ACM Trans. Comput. Log. 18 (1) (2017)
Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
Model Checking and Validity in Propositional and Modal Inclusion Logics. MFCS (2017)
Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
Team Semantics for the Specification and Verification of Hyperproperties. CoRR (2017)
Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler
Backdoors for Linear Temporal Logic. IPEC (2016)
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
Approximation and Dependence via Multiteam Semantics. FoIKS (2016)
Johannes Klaus Fichte, Arne Meier, Irina Schindler
Strong Backdoors for Default Logic. SAT (2016)
Johannes Klaus Fichte, Arne Meier, Irina Schindler
Strong Backdoors for Default Logic. CoRR (2016)
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
Strong Backdoors for Linear Temporal Logic. CoRR (2016)
Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
Model Checking and Validity in Propositional and Modal Inclusion Logics. CoRR (2016)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR (2015)
Martin Lück, Arne Meier, Irina Schindler
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. LATA (2015)
Andreas Krebs, Arne Meier, Martin Mundhenk
The Model Checking Fingerprints of CTL Operators. TIME (2015)
Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54 (5-6) (2015)
Martin Lück, Arne Meier
LTL Fragments are Hard for Standard Parameterisations. CoRR (2015)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) (2015)
Martin Lück, Arne Meier
LTL Fragments are Hard for Standard Parameterisations. TIME (2015)
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
Approximation and Dependence via Multiteam Semantics. CoRR (2015)
Andreas Krebs, Arne Meier, Jonni Virtema
Parallel Computational Tree Logic. CoRR (2015)
Andreas Krebs, Arne Meier, Martin Mundhenk
The model checking fingerprints of CTL operators. CoRR (2015)
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
. Int. J. Found. Comput. Sci. 26 (8) (2015)
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
Parameterized Enumeration for Modification Problems. LATA (2015)
Andreas Krebs, Arne Meier, Jonni Virtema
A Team Based Variant of CTL. TIME (2015)
Martin Lück, Arne Meier, Irina Schindler
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem. CoRR (2014)
Martin Lück, Arne Meier, Irina Schindler
Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. Electron. Colloquium Comput. Complex. 21 (2014)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. MFCS (2013)
Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer
Extended Modal Dependence Logic. WoLLIC (2013)
Arne Meier, Thomas Schneider
Generalized satisfiability for the description logic ALC. Theor. Comput. Sci. 505 (2013)
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
Parameterized Enumeration with Ordering. CoRR (2013)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. CoRR (2013)
Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer
Complexity of Model Checking for Logics over Kripke models. Bull. EATCS 108 (2012)
Arne Meier
Generalized Complexity of ALC Subsumption CoRR (2012)
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA (2012)
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers CoRR (2012)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The complexity of reasoning for fragments of default logic. J. Log. Comput. 22 (3) (2012)
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. Advances in Modal Logic (2012)
Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13 (2) (2012)
Arne Meier, Thomas Schneider
- (Extended Abstract). TAMC (2011)
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the Parameterized Complexity of Default Logic and Autoepistemic Logic CoRR (2011)
Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer
Model Checking CTL is Almost Always Inherently Sequential Log. Methods Comput. Sci. 7 (2) (2011)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof complexity of propositional default logic. Arch. Math. Log. 50 (7-8) (2011)
Arne Meier, Thomas Schneider
Generalized Satisfiability for the Description Logic ALC CoRR (2011)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games (2010)
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
The complexity of satisfiability for fragments of hybrid logic - Part I. J. Appl. Log. 8 (4) (2010)
Arne Meier, Thomas Schneider
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC CoRR (2010)
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games (2010)
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Autoepistemic Logic CoRR (2010)
Arne Meier, Thomas Schneider
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. Description Logics (2010)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof Complexity of Propositional Default Logic. SAT (2010)
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 20 (5) (2009)
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I CoRR (2009)
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. MFCS (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Default Logic. SAT (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The complexity of propositional implication. Inf. Process. Lett. 109 (18) (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider
Model Checking CTL is Almost Always Inherently Sequential. TIME (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Propositional Implication CoRR (2008)

Arne Meier.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Arne Meier