The Complexity of Satisfiability for Fragments of CTL and CTL*. - Arne Meier; Martin Mundhenk; Michael Thomas 001; Heribert Vollmer (RP, 2008)

The Complexity of Satisfiability for Fragments of CTL and CTL*. - Arne Meier; Michael Thomas 001; Heribert Vollmer; Martin Mundhenk (Int. J. Found. Comput. Sci., 2009)

The complexity of propositional implication. - Olaf Beyersdorff; Arne Meier; Michael Thomas 001; Heribert Vollmer (Inf. Process. Lett., 2009)

The Complexity of Satisfiability for Sub-Boolean Fragments of ALC. - Arne Meier; Thomas Schneider 002 (Description Logics, 2010)

The complexity of satisfiability for fragments of hybrid logic - Part I. - Arne Meier; Martin Mundhenk; Thomas Schneider 002; Michael Thomas 001; Volker Weber; Felix Weiss (J. Appl. Log., 2010)

On the Complexity of Modal Logic Variants and their Fragments. - Arne Meier (Cuvillier, 2011)

Generalized Satisfiability for the Description Logic ALC - (Extended Abstract). - Arne Meier; Thomas Schneider 002 (TAMC, 2011)

Proof complexity of propositional default logic. - Olaf Beyersdorff; Arne Meier; Sebastian Müller 003; Michael Thomas 001; Heribert Vollmer (Arch. Math. Log., 2011)

Model Checking CTL is Almost Always Inherently Sequential - Olaf Beyersdorff; Arne Meier; Martin Mundhenk; Thomas Schneider 002; Michael Thomas 001; Heribert Vollmer (Log. Methods Comput. Sci., 2011)

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. - Stefan Göller; Arne Meier; Martin Mundhenk; Thomas Schneider 002; Michael Thomas 001; Felix Weiß (Advances in Modal Logic, 2012)

On the Parameterized Complexity of Default Logic and Autoepistemic Logic. - Arne Meier; Johannes Schmidt 001; Michael Thomas 001; Heribert Vollmer (LATA, 2012)

Generalized Complexity of ALC Subsumption - Arne Meier (CoRR, 2012)

Complexity of Model Checking for Logics over Kripke models. - Arne Meier; Julian-Steffen Müller; Martin Mundhenk; Heribert Vollmer (Bull. EATCS, 2012)

The complexity of reasoning for fragments of default logic. - Olaf Beyersdorff; Arne Meier; Michael Thomas 001; Heribert Vollmer (J. Log. Comput., 2012)

The Complexity of Reasoning for Fragments of Autoepistemic Logic. - Nadia Creignou; Arne Meier; Heribert Vollmer; Michael Thomas 001 (ACM Trans. Comput. Log., 2012)

Extended Modal Dependence Logic. - Johannes Ebbing; Lauri Hella; Arne Meier; Julian-Steffen Müller; Jonni Virtema; Heribert Vollmer (WoLLIC, 2013)

Parameterized Enumeration with Ordering. - Nadia Creignou; Raïda Ktari; Arne Meier; Julian-Steffen Müller; Frédéric Olive; Heribert Vollmer (CoRR, 2013)

Generalized satisfiability for the description logic ALC. - Arne Meier; Thomas Schneider 002 (Theor. Comput. Sci., 2013)

Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. - Martin Lück; Arne Meier; Irina Schindler (Electron. Colloquium Comput. Complex., 2014)

Komplexität von Algorithmen. - Arne Meier; Heribert Vollmer (Lehmanns Media, 2015)

Parameterized Enumeration for Modification Problems. - Nadia Creignou; Raïda Ktari; Arne Meier; Julian-Steffen Müller; Frédéric Olive; Heribert Vollmer (LATA, 2015)

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. - Martin Lück; Arne Meier; Irina Schindler (LATA, 2015)

Modal Inclusion Logic: Being Lax is Simpler than Being Strict. - Lauri Hella; Antti Kuusisto; Arne Meier; Heribert Vollmer (MFCS (1), 2015)

A Team Based Variant of CTL. - Andreas Krebs; Arne Meier; Jonni Virtema (TIME, 2015)

LTL Fragments are Hard for Standard Parameterisations. - Martin Lück; Arne Meier (TIME, 2015)

On the parameterized complexity of non-monotonic logics. - Arne Meier; Irina Schindler; Johannes Schmidt 001; Michael Thomas 001; Heribert Vollmer (Arch. Math. Log., 2015)

Parallel Computational Tree Logic. - Andreas Krebs; Arne Meier; Jonni Virtema (CoRR, 2015)

Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. - Arne Meier; Michael Thomas 001; Heribert Vollmer; Martin Mundhenk (Int. J. Found. Comput. Sci., 2015)

Strong Backdoors for Linear Temporal Logic. - Arne Meier; Sebastian Ordyniak; M. S. Ramanujan 001; Irena Schindler (CoRR, 2016)

Paradigms for Parameterized Enumeration. - Nadia Creignou; Arne Meier; Julian-Steffen Müller; Johannes Schmidt 001; Heribert Vollmer (Theory Comput. Syst., 2017)

Parametrised Complexity of Satisfiability in Temporal Logic. - Martin Lück; Arne Meier; Irena Schindler (ACM Trans. Comput. Log., 2017)

Probabilistic Team Semantics. - Arnaud Durand 001; Miika Hannula; Juha Kontinen; Arne Meier; Jonni Virtema (FoIKS, 2018)

Enumeration Complexity of Poor Man's Propositional Dependence Logic. - Arne Meier; Christian Reinbold (FoIKS, 2018)

Team Semantics for the Specification and Verification of Hyperproperties. - Andreas Krebs; Arne Meier; Jonni Virtema; Martin Zimmermann 002 (MFCS, 2018)

Approximation and dependence via multiteam semantics. - Arnaud Durand 001; Miika Hannula; Juha Kontinen; Arne Meier; Jonni Virtema (Ann. Math. Artif. Intell., 2018)

Enumeration in Incremental FPT-Time. - Arne Meier (CoRR, 2018)

The model checking fingerprints of CTL operators. - Andreas Krebs; Arne Meier; Martin Mundhenk (Acta Informatica, 2019)

Backdoors for Linear Temporal Logic. - Arne Meier; Sebastian Ordyniak; M. S. Ramanujan 001; Irena Schindler (Algorithmica, 2019)

Parameterised Enumeration for Modification Problems. - Nadia Creignou; Raïda Ktari; Arne Meier; Julian-Steffen Müller; Frédéric Olive; Heribert Vollmer (Algorithms, 2019)

Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. - Yasir Mahmood 002; Arne Meier (CoRR, 2019)

Parameterised Counting Classes with Bounded Nondeterminism. - Anselm Haak; Arne Meier; Om Prakash 002; B. V. Raghavendra Rao (CoRR, 2019)

Parameterised Complexity for Abduction. - Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (CoRR, 2019)

Model checking and validity in propositional and modal inclusion logics. - Lauri Hella; Antti Kuusisto; Arne Meier; Jonni Virtema (J. Log. Comput., 2019)

Parametrised enumeration. - Arne Meier (2020)

Parameterised Complexity of Abduction in Schaefer's Framework. - Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (LFCS, 2020)

Incremental FPT Delay. - Arne Meier (Algorithms, 2020)

Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. - Lauri Hella; Antti Kuusisto; Arne Meier; Heribert Vollmer (ACM Trans. Comput. Log., 2020)

Knowledge-Base Degrees of Inconsistency: Complexity and Counting. - Johannes Klaus Fichte; Markus Hecher; Arne Meier (AAAI, 2021)

Decomposition-Guided Reductions for Argumentation and Treewidth. - Johannes Klaus Fichte; Markus Hecher; Yasir Mahmood 002; Arne Meier (IJCAI, 2021)

Parameterized complexity of abduction in Schaefer's framework. - Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (J. Log. Comput., 2021)

Submodel Enumeration of Kripke Structures in Modal Logic. - Nicolas Fröhlich 001; Arne Meier (AiML, 2022)

A Parameterized View on the Complexity of Dependence Logic. - Juha Kontinen; Arne Meier; Yasir Mahmood 002 (LFCS, 2022)

Temporal Team Semantics Revisited. - Jens Oliver Gutsfeld; Arne Meier; Christoph Ohrem; Jonni Virtema (LICS, 2022)

Parameterised complexity of model checking and satisfiability in propositional dependence logic. - Yasir Mahmood 002; Arne Meier (Ann. Math. Artif. Intell., 2022)

Enumerating teams in first-order team logics. - Anselm Haak; Arne Meier; Fabian Müller 003; Heribert Vollmer (Ann. Pure Appl. Log., 2022)

A parameterized view on the complexity of dependence and independence logic. - Juha Kontinen; Arne Meier; Yasir Mahmood 002 (J. Log. Comput., 2022)

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. - Johannes Klaus Fichte; Markus Hecher; Yasir Mahmood 002; Arne Meier (IJCAI, 2023)

Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework. - Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (ACM Trans. Comput. Log., 2023)

Parameterised Counting in Logspace. - Anselm Haak; Arne Meier; Om Prakash 002; B. V. Raghavendra Rao (Algorithmica, 2023)

Submodel Enumeration for CTL Is Hard. - Nicolas Fröhlich 001; Arne Meier (AAAI, 2024)

Rejection in Abstract Argumentation: Harder Than Acceptance? - Johannes Klaus Fichte; Markus Hecher; Yasir Mahmood 002; Arne Meier (ECAI, 2024)

Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. - Markus Hecher; Yasir Mahmood 002; Arne Meier; Johannes Schmidt 001 (IJCAI, 2024)

Synchronous Team Semantics for Temporal Logics. - Andreas Krebs; Arne Meier; Jonni Virtema; Martin Zimmermann 002 (CoRR, 2024)

Parameterised Complexity of Consistent Query Answering via Graph Representations. - Teemu Hankala; Miika Hannula; Yasir Mahmood 002; Arne Meier (CoRR, 2024)

Counting Complexity for Reasoning in Abstract Argumentation. - Johannes Klaus Fichte; Markus Hecher; Arne Meier (J. Artif. Intell. Res., 2024)

Parameterized complexity of weighted team definability. - Juha Kontinen; Yasir Mahmood 002; Arne Meier; Heribert Vollmer (Math. Struct. Comput. Sci., 2024)

Strong Backdoors for Default Logic. - Johannes Klaus Fichte; Arne Meier; Irena Schindler (ACM Trans. Comput. Log., 2024)

A SUBSET-SUM Characterisation of the A-Hierarchy. - Jan Gutleben; Arne Meier (SOFSEM (2), 2025)

Logics with probabilistic team semantics and the Boolean negation. - Miika Hannula; Minna Hirvonen; Juha Kontinen; Yasir Mahmood 002; Arne Meier; Jonni Virtema (J. Log. Comput., 2025)

Logic and Computation Through the Lens of Semirings. - Timon Barlag; Nicolas Fröhlich 001; Teemu Hankala; Miika Hannula; Minna Hirvonen; Vivian Holzapfel; Juha Kontinen; Arne Meier; Laura Strieker (CoRR, 2025)

On the Complexity and Properties of Preferential Propositional Dependence Logic. - Kai Sauerwald; Arne Meier; Juha Kontinen (CoRR, 2025)

Facets in Argumentation: A Formal Approach to Argument Significance. - Johannes Klaus Fichte; Nicolas Fröhlich 001; Markus Hecher; Victor Lagerkvist; Yasir Mahmood 002; Arne Meier; Jonathan Persson (CoRR, 2025)