Arne Meier

According to our database, Arne Meier authored at least 74 papers between 2008 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Logical Approaches to Non-deterministic Polynomial Time over Semirings.

Timon Barlag, Nicolas Fröhlich, Teemu Hankala, Miika Hannula, Minna Hirvonen, Vivian Holzapfel, Juha Kontinen, Arne Meier, Laura Strieker

CoRR, September, 2025

Disjunctions of Two Dependence Atoms.

Nicolas Fröhlich, Phokion G. Kolaitis, Arne Meier

CoRR, August, 2025

On the Complexity and Properties of Preferential Propositional Dependence Logic.

Kai Sauerwald, Arne Meier, Juha Kontinen

CoRR, May, 2025

Logic and Computation Through the Lens of Semirings.

Timon Barlag, Nicolas Fröhlich, Teemu Hankala, Miika Hannula, Minna Hirvonen, Vivian Holzapfel, Juha Kontinen, Arne Meier, Laura Strieker

CoRR, February, 2025

A SUBSET-SUM Characterisation of the A-Hierarchy.

Jan Gutleben, Arne Meier

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Facets in Argumentation: A Formal Approach to Argument Significance.

Johannes Klaus Fichte, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

2024

Parameterized complexity of weighted team definability.

Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer

Math. Struct. Comput. Sci., 2024

Parameterised Complexity of Consistent Query Answering via Graph Representations.

Teemu Hankala, Miika Hannula, Yasir Mahmood, Arne Meier

CoRR, 2024

Synchronous Team Semantics for Temporal Logics.

Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann

CoRR, 2024

Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.

Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Rejection in Abstract Argumentation: Harder Than Acceptance?

Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Submodel Enumeration for CTL Is Hard.

Nicolas Fröhlich, Arne Meier

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Logics with Probabilistic Team Semantics and the Boolean Negation.

Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.

Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

A parameterized view on the complexity of dependence and independence logic.

Juha Kontinen, Arne Meier, Yasir Mahmood

J. Log. Comput., 2022

Enumerating teams in first-order team logics.

Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer

Ann. Pure Appl. Log., 2022

Temporal Team Semantics Revisited.

Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

A Parameterized View on the Complexity of Dependence Logic.

Juha Kontinen, Arne Meier, Yasir Mahmood

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Submodel Enumeration of Kripke Structures in Modal Logic.

Nicolas Fröhlich, Arne Meier

Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

2021

Parameterized complexity of abduction in Schaefer's framework.

Yasir Mahmood, Arne Meier, Johannes Schmidt

J. Log. Comput., 2021

Parameterised Counting in Logspace.

Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Decomposition-Guided Reductions for Argumentation and Treewidth.

Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Knowledge-Base Degrees of Inconsistency: Complexity and Counting.

Johannes Klaus Fichte, Markus Hecher, Arne Meier

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework.

Yasir Mahmood, Arne Meier, Johannes Schmidt

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics.

Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer

ACM Trans. Comput. Log., 2020

Incremental FPT Delay.

Arne Meier

Algorithms, 2020

Parameterised Complexity of Abduction in Schaefer's Framework.

Yasir Mahmood, Arne Meier, Johannes Schmidt

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.

Yasir Mahmood, Arne Meier

Proceedings of the Foundations of Information and Knowledge Systems, 2020

Parametrised enumeration.

Arne Meier

, 2020

2019

Parameterised Complexity for Abduction.

Yasir Mahmood, Arne Meier, Johannes Schmidt

CoRR, 2019

Parameterised Counting Classes with Bounded Nondeterminism.

Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao

CoRR, 2019

Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.

Yasir Mahmood, Arne Meier

CoRR, 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

Counting Complexity for Reasoning in Abstract Argumentation.

Johannes Klaus Fichte, Markus Hecher, Arne Meier

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Enumeration in Incremental FPT-Time.

Arne Meier

CoRR, 2018

Team Semantics for the Specification and Verification of Hyperproperties.

Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Enumeration Complexity of Poor Man's Propositional Dependence Logic.

Arne Meier, Christian Reinbold

Proceedings of the Foundations of Information and Knowledge Systems, 2018

Probabilistic Team Semantics.

Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema

Proceedings of the Foundations of Information and Knowledge Systems, 2018

2017

Parametrised Complexity of Satisfiability in Temporal Logic.

Martin Lück, Arne Meier, Irena Schindler

ACM Trans. Comput. Log., 2017

Model Checking and Validity in Propositional and Modal Inclusion Logics.

Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Strong Backdoors for Linear Temporal Logic.

Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler

CoRR, 2016

Strong Backdoors for Default Logic.

Johannes Klaus Fichte, Arne Meier, Irina Schindler

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Backdoors for Linear Temporal Logic.

Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Approximation and Dependence via Multiteam Semantics.

Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema

Proceedings of the Foundations of Information and Knowledge Systems, 2016

2015

Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL^⋆.

Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk

Int. J. Found. Comput. Sci., 2015

Parallel Computational Tree Logic.

Andreas Krebs, Arne Meier, Jonni Virtema

CoRR, 2015

On the parameterized complexity of non-monotonic logics.

Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer

Arch. Math. Log., 2015

LTL Fragments are Hard for Standard Parameterisations.

Martin Lück, Arne Meier

Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

A Team Based Variant of CTL.

Andreas Krebs, Arne Meier, Jonni Virtema

Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

The Model Checking Fingerprints of CTL Operators.

Andreas Krebs, Arne Meier, Martin Mundhenk

Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

Modal Inclusion Logic: Being Lax is Simpler than Being Strict.

Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.

Martin Lück, Arne Meier, Irina Schindler

Proceedings of the Language and Automata Theory and Applications, 2015

Parameterized Enumeration for Modification Problems.

Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer

Proceedings of the Language and Automata Theory and Applications, 2015

Komplexität von Algorithmen.

Arne Meier, Heribert Vollmer

Mathematik für Anwendungen 4, Lehmanns Media, ISBN: 978-3-86541-761-9, 2015

2014

Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies.

Martin Lück, Arne Meier, Irina Schindler

Electron. Colloquium Comput. Complex., 2014

2013

Generalized satisfiability for the description logic ALC.

Arne Meier, Thomas Schneider

Theor. Comput. Sci., 2013

Parameterized Enumeration with Ordering.

Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer

CoRR, 2013

Extended Modal Dependence Logic.

Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer

Proceedings of the Logic, Language, Information, and Computation, 2013

Paradigms for Parameterized Enumeration.

Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012

Complexity of Model Checking for Logics over Kripke models.

Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer

Bull. EATCS, 2012

Generalized Complexity of ALC Subsumption

Arne Meier

CoRR, 2012

On the Parameterized Complexity of Default Logic and Autoepistemic Logic.

Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer

Proceedings of the Language and Automata Theory and Applications, 2012

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers.

Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß

Proceedings of the Advances in Modal Logic 9, 2012

2011

Generalized Satisfiability for the Description Logic <i>ALC</i> - (Extended Abstract).

Arne Meier, Thomas Schneider

Proceedings of the Theory and Applications of Models of Computation, 2011

On the Complexity of Modal Logic Variants and their Fragments.

Arne Meier

Cuvillier, ISBN: 978-3-86955-929-2, 2011

2010

The Complexity of Satisfiability for Sub-Boolean Fragments of ALC.

Arne Meier, Thomas Schneider

Proceedings of the 23rd International Workshop on Description Logics (DL 2010), 2010

The Complexity of Reasoning for Fragments of Autoepistemic Logic.

Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer

Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

Proof Complexity of Propositional Default Logic.

Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer

Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

2009

The complexity of propositional implication.

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer

Inf. Process. Lett., 2009

The Complexity of Satisfiability for Fragments of CTL and CTL*.

Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk

Int. J. Found. Comput. Sci., 2009

Model Checking CTL is Almost Always Inherently Sequential.

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider

Proceedings of the TIME 2009, 2009

The Complexity of Reasoning for Fragments of Default Logic.

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I.

Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

The Complexity of Satisfiability for Fragments of CTL and CTL^*.

Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer

Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008