Arne Meier

129 papers A* 11A 5B 9C 9Misc 2Journal 78Unranked 11
YearRankTypeTitle / Venue / Authors
2026 B conf
Disjunctions of Two Dependence Atoms.
CSL
Nicolas Fröhlich, Phokion G. Kolaitis, Arne Meier
2026 J jnl
Modal Fragments.
CoRR
Nick Bezhanishvili, Balder ten Cate, Arunavo Ganguly, Arne Meier
2026 J jnl
Representation Theorems for Cumulative Propositional Dependence Logics.
CoRR
Juha Kontinen, Arne Meier, Kai Sauerwald
2026 — conf
When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames.
FoIKS
Andreas Krebs, Arne Meier
2025 A* conf
A Logic-Based Framework for Database Repairs.
KR
Nicolas Fröhlich, Arne Meier, Nina Pardal, Jonni Virtema
2025 — conf
A SUBSET-SUM Characterisation of the A-Hierarchy.
SOFSEM (2)
Jan Gutleben, Arne Meier
2025 J jnl
Disjunctions of Two Dependence Atoms.
CoRR
Nicolas Fröhlich, Phokion G. Kolaitis, Arne Meier
2025 A* conf
Facets in Argumentation: A Formal Approach to Argument Significance.
IJCAI
Johannes Klaus Fichte, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson
2025 J jnl
Facets in Argumentation: A Formal Approach to Argument Significance.
CoRR
Johannes Klaus Fichte, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson
2025 J jnl
Logic and Computation Through the Lens of Semirings.
CoRR
Timon Barlag, Nicolas Fröhlich, Teemu Hankala, Miika Hannula, Minna Hirvonen, Vivian Holzapfel, Juha Kontinen, Arne Meier, Laura Strieker
2025 J jnl
Logical Approaches to Non-deterministic Polynomial Time over Semirings.
CoRR
Timon Barlag, Nicolas Fröhlich, Teemu Hankala, Miika Hannula, Minna Hirvonen, Vivian Holzapfel, Juha Kontinen, Arne Meier, Laura Strieker
2025 J jnl
Logics with probabilistic team semantics and the Boolean negation.
J. Log. Comput.
Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema
2025 A* conf
On the Complexity and Properties of Preferential Propositional Dependence Logic.
KR
Kai Sauerwald, Arne Meier, Juha Kontinen
2025 J jnl
On the Complexity and Properties of Preferential Propositional Dependence Logic.
CoRR
Kai Sauerwald, Arne Meier, Juha Kontinen
2025 J jnl
When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames.
CoRR
Andreas Krebs, Arne Meier
2024 J jnl
A SUBSET-SUM Characterisation of the A-Hierarchy.
CoRR
Jan Gutleben, Arne Meier
2024 J jnl
Counting Complexity for Reasoning in Abstract Argumentation.
J. Artif. Intell. Res.
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2024 — ed.
Foundations of Information and Knowledge Systems - 13th International Symposium, FoIKS 2024, Sheffield, UK, April 8-11, 2024, Proceedings
FoIKS
Arne Meier, Magdalena Ortiz
2024 J jnl
Parameterised Complexity of Consistent Query Answering via Graph Representations.
CoRR
Teemu Hankala, Miika Hannula, Yasir Mahmood, Arne Meier
2024 J jnl
Parameterized complexity of weighted team definability.
Math. Struct. Comput. Sci.
Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer
2024 A* conf
Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.
IJCAI
Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt
2024 A conf
Rejection in Abstract Argumentation: Harder Than Acceptance?
ECAI
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2024 J jnl
Rejection in Abstract Argumentation: Harder Than Acceptance?
CoRR
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2024 J jnl
Strong Backdoors for Default Logic.
ACM Trans. Comput. Log.
Johannes Klaus Fichte, Arne Meier, Irena Schindler
2024 A* conf
Submodel Enumeration for CTL Is Hard.
AAAI
Nicolas Fröhlich, Arne Meier
2024 J jnl
Synchronous Team Semantics for Temporal Logics.
CoRR
Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
2023 B conf
Logics with Probabilistic Team Semantics and the Boolean Negation.
JELIA
Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema
2023 J jnl
Logics with probabilistic team semantics and the Boolean negation.
CoRR
Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema
2023 J jnl
Parameterised Counting in Logspace.
Algorithmica
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
2023 J jnl
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework.
ACM Trans. Comput. Log.
Yasir Mahmood, Arne Meier, Johannes Schmidt
2023 J jnl
Parameterized Complexity of Weighted Team Definability.
CoRR
Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer
2023 A* conf
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.
IJCAI
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2023 J jnl
Submodel Enumeration for CTL Is Hard.
CoRR
Nicolas Fröhlich, Arne Meier
2022 Misc conf
A Parameterized View on the Complexity of Dependence Logic.
LFCS
Juha Kontinen, Arne Meier, Yasir Mahmood
2022 J jnl
A parameterized view on the complexity of dependence and independence logic.
J. Log. Comput.
Juha Kontinen, Arne Meier, Yasir Mahmood
2022 J jnl
Enumerating teams in first-order team logics.
Ann. Pure Appl. Log.
Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
2022 J jnl
Parameterised complexity of model checking and satisfiability in propositional dependence logic.
Ann. Math. Artif. Intell.
Yasir Mahmood, Arne Meier
2022 B conf
Submodel Enumeration of Kripke Structures in Modal Logic.
AiML
Nicolas Fröhlich, Arne Meier
2022 A* conf
Temporal Team Semantics Revisited.
LICS
Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema
2021 J jnl
A Parameterized View on the Complexity of Dependence Logic.
CoRR
Juha Kontinen, Arne Meier, Yasir Mahmood
2021 A* conf
Decomposition-Guided Reductions for Argumentation and Treewidth.
IJCAI
Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier
2021 A* conf
Knowledge-Base Degrees of Inconsistency: Complexity and Counting.
AAAI
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2021 A conf
Parameterised Counting in Logspace.
STACS
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
2021 A* conf
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework.
AAAI
Yasir Mahmood, Arne Meier, Johannes Schmidt
2021 J jnl
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework.
CoRR
Yasir Mahmood, Arne Meier, Johannes Schmidt
2021 J jnl
Parameterized complexity of abduction in Schaefer's framework.
J. Log. Comput.
Yasir Mahmood, Arne Meier, Johannes Schmidt
2021 J jnl
Temporal Team Semantics Revisited.
CoRR
Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema
2020 J jnl
Enumerating Teams in First-Order Team Logics.
CoRR
Anselm Haak, Arne Meier, Fabian Müller, Heribert Vollmer
2020 J jnl
Incremental FPT Delay.
Algorithms
Arne Meier
2020 Misc conf
Parameterised Complexity of Abduction in Schaefer's Framework.
LFCS
Yasir Mahmood, Arne Meier, Johannes Schmidt
2020 — conf
Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.
FoIKS
Yasir Mahmood, Arne Meier
2020 — book
Parametrised enumeration.
Arne Meier
2020 J jnl
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics.
ACM Trans. Comput. Log.
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2019 J jnl
Backdoors for Linear Temporal Logic.
Algorithmica
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
2019 A* conf
Counting Complexity for Reasoning in Abstract Argumentation.
AAAI
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2019 J jnl
Model checking and validity in propositional and modal inclusion logics.
J. Log. Comput.
Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
2019 J jnl
Parameterised Complexity for Abduction.
CoRR
Yasir Mahmood, Arne Meier, Johannes Schmidt
2019 J jnl
Parameterised Counting Classes with Bounded Nondeterminism.
CoRR
Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao
2019 J jnl
Parameterised Enumeration for Modification Problems.
Algorithms
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
2019 J jnl
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.
CoRR
Yasir Mahmood, Arne Meier
2019 J jnl
The model checking fingerprints of CTL operators.
Acta Informatica
Andreas Krebs, Arne Meier, Martin Mundhenk
2018 J jnl
Approximation and dependence via multiteam semantics.
Ann. Math. Artif. Intell.
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2018 J jnl
Counting Complexity for Reasoning in Abstract Argumentation.
CoRR
Johannes Klaus Fichte, Markus Hecher, Arne Meier
2018 — conf
Enumeration Complexity of Poor Man's Propositional Dependence Logic.
FoIKS
Arne Meier, Christian Reinbold
2018 J jnl
Enumeration in Incremental FPT-Time.
CoRR
Arne Meier
2018 — conf
Probabilistic Team Semantics.
FoIKS
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2018 J jnl
Probabilistic team semantics.
CoRR
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2018 B conf
Team Semantics for the Specification and Verification of Hyperproperties.
MFCS
Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
2017 J jnl
Enumeration Complexity of Poor Man's Propositional Dependence Logic.
CoRR
Arne Meier, Christian Reinbold
2017 B conf
Model Checking and Validity in Propositional and Modal Inclusion Logics.
MFCS
Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
2017 J jnl
Paradigms for Parameterized Enumeration.
Theory Comput. Syst.
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2017 J jnl
Parametrised Complexity of Satisfiability in Temporal Logic.
ACM Trans. Comput. Log.
Martin Lück, Arne Meier, Irena Schindler
2017 J jnl
Team Semantics for the Specification and Verification of Hyperproperties.
CoRR
Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
2016 — conf
Approximation and Dependence via Multiteam Semantics.
FoIKS
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2016 B conf
Backdoors for Linear Temporal Logic.
IPEC
Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler
2016 J jnl
Model Checking and Validity in Propositional and Modal Inclusion Logics.
CoRR
Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
2016 A conf
Strong Backdoors for Default Logic.
SAT
Johannes Klaus Fichte, Arne Meier, Irina Schindler
2016 J jnl
Strong Backdoors for Default Logic.
CoRR
Johannes Klaus Fichte, Arne Meier, Irina Schindler
2016 J jnl
Strong Backdoors for Linear Temporal Logic.
CoRR
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
2015 C conf
A Team Based Variant of CTL.
TIME
Andreas Krebs, Arne Meier, Jonni Virtema
2015 J jnl
Approximation and Dependence via Multiteam Semantics.
CoRR
Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2015 J jnl
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL
Int. J. Found. Comput. Sci.
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
2015 — book
Komplexität von Algorithmen.
Arne Meier, Heribert Vollmer
2015 C conf
LTL Fragments are Hard for Standard Parameterisations.
TIME
Martin Lück, Arne Meier
2015 J jnl
LTL Fragments are Hard for Standard Parameterisations.
CoRR
Martin Lück, Arne Meier
2015 — conf
Modal Inclusion Logic: Being Lax is Simpler than Being Strict.
MFCS (1)
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2015 J jnl
On the parameterized complexity of non-monotonic logics.
Arch. Math. Log.
Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2015 J jnl
Parallel Computational Tree Logic.
CoRR
Andreas Krebs, Arne Meier, Jonni Virtema
2015 C conf
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.
LATA
Martin Lück, Arne Meier, Irina Schindler
2015 C conf
Parameterized Enumeration for Modification Problems.
LATA
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
2015 J jnl
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics.
CoRR
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2015 C conf
The Model Checking Fingerprints of CTL Operators.
TIME
Andreas Krebs, Arne Meier, Martin Mundhenk
2015 J jnl
The model checking fingerprints of CTL operators.
CoRR
Andreas Krebs, Arne Meier, Martin Mundhenk
2014 J jnl
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem.
CoRR
Martin Lück, Arne Meier, Irina Schindler
2014 J jnl
Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies.
Electron. Colloquium Comput. Complex.
Martin Lück, Arne Meier, Irina Schindler
2013 C conf
Extended Modal Dependence Logic.
WoLLIC
Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer
2013 J jnl
Generalized satisfiability for the description logic ALC.
Theor. Comput. Sci.
Arne Meier, Thomas Schneider
2013 B conf
Paradigms for Parameterized Enumeration.
MFCS
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2013 J jnl
Paradigms for Parameterized Enumeration.
CoRR
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2013 J jnl
Parameterized Enumeration with Ordering.
CoRR
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer
2012 J jnl
Complexity of Model Checking for Logics over Kripke models.
Bull. EATCS
Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer
2012 J jnl
Generalized Complexity of ALC Subsumption
CoRR
Arne Meier
2012 C conf
On the Parameterized Complexity of Default Logic and Autoepistemic Logic.
LATA
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2012 J jnl
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
CoRR
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss
2012 B conf
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers.
Advances in Modal Logic
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß
2012 J jnl
The Complexity of Reasoning for Fragments of Autoepistemic Logic.
ACM Trans. Comput. Log.
Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas
2012 J jnl
The complexity of reasoning for fragments of default logic.
J. Log. Comput.
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2011 C conf
Generalized Satisfiability for the Description Logic
TAMC
Arne Meier, Thomas Schneider
2011 J jnl
Generalized Satisfiability for the Description Logic ALC
CoRR
Arne Meier, Thomas Schneider
2011 J jnl
Model Checking CTL is Almost Always Inherently Sequential
Log. Methods Comput. Sci.
Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer
2011 — book
On the Complexity of Modal Logic Variants and their Fragments.
Arne Meier
2011 J jnl
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
CoRR
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2011 J jnl
Proof complexity of propositional default logic.
Arch. Math. Log.
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2010 — conf
Proof Complexity of Propositional Default Logic.
Circuits, Logic, and Games
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2010 A conf
Proof Complexity of Propositional Default Logic.
SAT
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2010 J jnl
The Complexity of Reasoning for Fragments of Autoepistemic Logic
CoRR
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
2010 — conf
The Complexity of Reasoning for Fragments of Autoepistemic Logic.
Circuits, Logic, and Games
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
2010 J jnl
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
CoRR
Arne Meier, Thomas Schneider
2010 — conf
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC.
Description Logics
Arne Meier, Thomas Schneider
2010 J jnl
The complexity of satisfiability for fragments of hybrid logic - Part I.
J. Appl. Log.
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2009 C conf
Model Checking CTL is Almost Always Inherently Sequential.
TIME
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider
2009 A conf
The Complexity of Reasoning for Fragments of Default Logic.
SAT
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2009 J jnl
The Complexity of Satisfiability for Fragments of CTL and CTL*.
Int. J. Found. Comput. Sci.
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
2009 J jnl
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I
CoRR
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2009 B conf
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I.
MFCS
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2009 J jnl
The complexity of propositional implication.
Inf. Process. Lett.
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2008 J jnl
The Complexity of Propositional Implication
CoRR
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2008 J jnl
The Complexity of Reasoning for Fragments of Default Logic
CoRR
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2008 — conf
The Complexity of Satisfiability for Fragments of CTL and CTL
RP
Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer