Arne Meier

Orcid: 0000-0002-8061-5376

Affiliations:
  • Leibniz Universität Hannover, Germany


According to our database1, Arne Meier authored at least 64 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Submodel Enumeration for CTL Is Hard.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Parameterised Counting in Logspace.
Algorithmica, October, 2023

Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework.
ACM Trans. Comput. Log., 2023

Parameterized Complexity of Weighted Team Definability.
CoRR, 2023

Logics with Probabilistic Team Semantics and the Boolean Negation.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
A parameterized view on the complexity of dependence and independence logic.
J. Log. Comput., 2022

Enumerating teams in first-order team logics.
Ann. Pure Appl. Log., 2022

Parameterised complexity of model checking and satisfiability in propositional dependence logic.
Ann. Math. Artif. Intell., 2022

Temporal Team Semantics Revisited.
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.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Submodel Enumeration of Kripke Structures in Modal Logic.
Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

2021
Parameterized complexity of abduction in Schaefer's framework.
J. Log. Comput., 2021

Decomposition-Guided Reductions for Argumentation and Treewidth.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Knowledge-Base Degrees of Inconsistency: Complexity and Counting.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics.
ACM Trans. Comput. Log., 2020

Incremental FPT Delay.
Algorithms, 2020

Parameterised Complexity of Abduction in Schaefer's Framework.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

Parametrised enumeration.
, 2020

2019
Model checking and validity in propositional and modal inclusion logics.
J. Log. Comput., 2019

Parameterised Complexity for Abduction.
CoRR, 2019

Parameterised Counting Classes with Bounded Nondeterminism.
CoRR, 2019

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

Parameterised Enumeration for Modification Problems.
Algorithms, 2019

Backdoors for Linear Temporal Logic.
Algorithmica, 2019

The model checking fingerprints of CTL operators.
Acta Informatica, 2019

Counting Complexity for Reasoning in Abstract Argumentation.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Enumeration in Incremental FPT-Time.
CoRR, 2018

Approximation and dependence via multiteam semantics.
Ann. Math. Artif. Intell., 2018

Team Semantics for the Specification and Verification of Hyperproperties.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Enumeration Complexity of Poor Man's Propositional Dependence Logic.
Proceedings of the Foundations of Information and Knowledge Systems, 2018

Probabilistic Team Semantics.
Proceedings of the Foundations of Information and Knowledge Systems, 2018

2017
Parametrised Complexity of Satisfiability in Temporal Logic.
ACM Trans. Comput. Log., 2017

Paradigms for Parameterized Enumeration.
Theory Comput. Syst., 2017

2016
Strong Backdoors for Linear Temporal Logic.
CoRR, 2016

Strong Backdoors for Default Logic.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL<sup>⋆</sup>.
Int. J. Found. Comput. Sci., 2015

Parallel Computational Tree Logic.
CoRR, 2015

On the parameterized complexity of non-monotonic logics.
Arch. Math. Log., 2015

LTL Fragments are Hard for Standard Parameterisations.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

A Team Based Variant of CTL.
Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

Modal Inclusion Logic: Being Lax is Simpler than Being Strict.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.
Proceedings of the Language and Automata Theory and Applications, 2015

Parameterized Enumeration for Modification Problems.
Proceedings of the Language and Automata Theory and Applications, 2015

Komplexität von Algorithmen.
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.
Electron. Colloquium Comput. Complex., 2014

2013
Generalized satisfiability for the description logic ALC.
Theor. Comput. Sci., 2013

Parameterized Enumeration with Ordering.
CoRR, 2013

Extended Modal Dependence Logic.
Proceedings of the Logic, Language, Information, and Computation, 2013

2012
The Complexity of Reasoning for Fragments of Autoepistemic Logic.
ACM Trans. Comput. Log., 2012

The complexity of reasoning for fragments of default logic.
J. Log. Comput., 2012

Complexity of Model Checking for Logics over Kripke models.
Bull. EATCS, 2012

Generalized Complexity of ALC Subsumption
CoRR, 2012

On the Parameterized Complexity of Default Logic and Autoepistemic Logic.
Proceedings of the Language and Automata Theory and Applications, 2012

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers.
Proceedings of the Advances in Modal Logic 9, 2012

2011
Model Checking CTL is Almost Always Inherently Sequential
Log. Methods Comput. Sci., 2011

Proof complexity of propositional default logic.
Arch. Math. Log., 2011

Generalized Satisfiability for the Description Logic <i>ALC</i> - (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2011

On the Complexity of Modal Logic Variants and their Fragments.
Cuvillier, ISBN: 978-3-86955-929-2, 2011

2010
The complexity of satisfiability for fragments of hybrid logic - Part I.
J. Appl. Log., 2010

The Complexity of Satisfiability for Sub-Boolean Fragments of ALC.
Proceedings of the 23rd International Workshop on Description Logics (DL 2010), 2010

2009
The complexity of propositional implication.
Inf. Process. Lett., 2009

The Complexity of Satisfiability for Fragments of CTL and CTL*.
Int. J. Found. Comput. Sci., 2009

2008
The Complexity of Satisfiability for Fragments of CTL and CTL<sup>*</sup>.
Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008


  Loading...