Arne Meier
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
40
Venues
17
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
40 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CSL | Disjunctions of Two Dependence Atoms. | Nicolas Frhlich, Phokion G. Kolaitis, Arne Meier |
| 2026 | KR | Complexity of Logics with Semiring Semantics. | Timon Barlag, Nicolas Frhlich, Teemu Hankala, Miika Hannula, Minna Hirvonen, Vivian Holzapfel, Juha Kontinen, Arne Meier, Laura Strieker |
| 2026 | KR | Representation Theorems for Cumulative Propositional Dependence Logics. | Juha Kontinen, Arne Meier, Kai Sauerwald |
| 2026 | WoLLIC | A Circuit-Theoretic View of rmFO over Semirings. | Timon Barlag, Nicolas Frhlich, Teemu Hankala, Miika Juhani Hannula, Minna Hirvonen, Vivian Holzapfel, Juha Kontinen, Arne Meier, Laura Strieker |
| 2025 | IJCAI | Facets in Argumentation: A Formal Approach to Argument Significance. | Johannes Klaus Fichte, Nicolas Frhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, Jonathan Persson |
| 2025 | KR | A Logic-Based Framework for Database Repairs. | Nicolas Frhlich, Arne Meier, Nina Pardal, Jonni Virtema |
| 2025 | KR | On the Complexity and Properties of Preferential Propositional Dependence Logic. | Kai Sauerwald, Arne Meier, Juha Kontinen |
| 2025 | SOFSEM | A SUBSET-SUM Characterisation of the A-Hierarchy. | Jan Gutleben, Arne Meier |
| 2024 | AAAI | Submodel Enumeration for CTL Is Hard. | Nicolas Frhlich, Arne Meier |
| 2024 | ECAI | Rejection in Abstract Argumentation: Harder Than Acceptance? | Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier |
| 2024 | IJCAI | Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. | Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt |
| 2023 | IJCAI | Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. | Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier |
| 2023 | JELIA | Logics with Probabilistic Team Semantics and the Boolean Negation. | Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema |
| 2022 | AiML | Submodel Enumeration of Kripke Structures in Modal Logic. | Nicolas Frhlich, Arne Meier |
| 2022 | LFCS | A Parameterized View on the Complexity of Dependence Logic. | Juha Kontinen, Arne Meier, Yasir Mahmood |
| 2022 | LICS | Temporal Team Semantics Revisited. | Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema |
| 2021 | AAAI | Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. | Yasir Mahmood, Arne Meier, Johannes Schmidt |
| 2021 | AAAI | Knowledge-Base Degrees of Inconsistency: Complexity and Counting. | Johannes Klaus Fichte, Markus Hecher, Arne Meier |
| 2021 | IJCAI | Decomposition-Guided Reductions for Argumentation and Treewidth. | Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier |
| 2021 | STACS | Parameterised Counting in Logspace. | Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao |
| 2020 | LFCS | Parameterised Complexity of Abduction in Schaefer's Framework. | Yasir Mahmood, Arne Meier, Johannes Schmidt |
| 2019 | AAAI | Counting Complexity for Reasoning in Abstract Argumentation. | Johannes Klaus Fichte, Markus Hecher, Arne Meier |
| 2018 | MFCS | Team Semantics for the Specification and Verification of Hyperproperties. | Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann |
| 2017 | MFCS | Model Checking and Validity in Propositional and Modal Inclusion Logics. | Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema |
| 2016 | SAT | Strong Backdoors for Default Logic. | Johannes Klaus Fichte, Arne Meier, Irina Schindler |
| 2015 | LATA | Parameterized Enumeration for Modification Problems. | Nadia Creignou, Rada Ktari, Arne Meier, Julian-Steffen Mller, Frdric Olive, Heribert Vollmer |
| 2015 | LATA | Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. | Martin Lck, Arne Meier, Irina Schindler |
| 2015 | MFCS | Modal Inclusion Logic: Being Lax is Simpler than Being Strict. | Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer |
| 2015 | TIME | The Model Checking Fingerprints of CTL Operators. | Andreas Krebs, Arne Meier, Martin Mundhenk |
| 2015 | TIME | A Team Based Variant of CTL. | Andreas Krebs, Arne Meier, Jonni Virtema |
| 2015 | TIME | LTL Fragments are Hard for Standard Parameterisations. | Martin Lck, Arne Meier |
| 2013 | MFCS | Paradigms for Parameterized Enumeration. | Nadia Creignou, Arne Meier, Julian-Steffen Mller, Johannes Schmidt, Heribert Vollmer |
| 2013 | WoLLIC | Extended Modal Dependence Logic. | Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Mller, Jonni Virtema, Heribert Vollmer |
| 2012 | AiML | The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. | Stefan Gller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Wei |
| 2012 | LATA | On the Parameterized Complexity of Default Logic and Autoepistemic Logic. | Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer |
| 2011 | TAMC | Generalized Satisfiability for the Description Logic | Arne Meier, Thomas Schneider |
| 2010 | SAT | Proof Complexity of Propositional Default Logic. | Olaf Beyersdorff, Arne Meier, Sebastian Mller, Michael Thomas, Heribert Vollmer |
| 2009 | MFCS | The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. | Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss |
| 2009 | SAT | The Complexity of Reasoning for Fragments of Default Logic. | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer |
| 2009 | TIME | Model Checking CTL is Almost Always Inherently Sequential. | Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider |