Arne Meier

@inproceedings{DBLP:conf/wollic/BarlagFHHHHKMS26,
  author = {Barlag, Timon and Fr{\"{o}}hlich, Nicolas and Hankala, Teemu and Hannula, Miika Juhani and Hirvonen, Minna and Holzapfel, Vivian and Kontinen, Juha and Meier, Arne and Strieker, Laura},
  editor = {Johann, Patricia and de Queiroz, Ruy J. G. B.},
  title = {A Circuit-Theoretic View of FO over Semirings},
  booktitle = {Logic, Language, Information, and Computation - 32nd International
                    Workshop, WoLLIC 2026, Lima, Peru, August 3-6, 2026, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {16757},
  pages = {111--125},
  publisher = {Springer},
  year = {2026},
  url = {https://doi.org/10.1007/978-3-032-33486-2\_8},
  doi = {10.1007/978-3-032-33486-2\_8},
  keywords = {semiring semantics, circuit complexity, first-order logic, knowledge representation, model checking, complexity theory}
}

@inproceedings{DBLP:conf/kr/BarlagFHHHHKMS26,
  author = {Barlag, Timon and Fr{\"{o}}hlich, Nicolas and Hankala, Teemu and Hannula, Miika and Hirvonen, Minna and Holzapfel, Vivian and Kontinen, Juha and Meier, Arne and Strieker, Laura},
  editor = {Wassermann, Renata and Mugnier, Marie{-}Laure and Baader, Franz},
  title = {Complexity of Logics with Semiring Semantics},
  booktitle = {Proceedings of the 23rd International Conference on Principles of
                    Knowledge Representation and Reasoning, {KR} 2026, Lisbon, Portugal,
                    July 20-23, 2026},
  year = {2026},
  doi = {10.24963/KR.2026/12},
  keywords = {semiring semantics, complexity, logic, knowledge representation}
}

@inproceedings{DBLP:conf/kr/KontinenMS26,
  author = {Kontinen, Juha and Meier, Arne and Sauerwald, Kai},
  editor = {Wassermann, Renata and Mugnier, Marie{-}Laure and Baader, Franz},
  title = {Representation Theorems for Cumulative Propositional Dependence Logics},
  booktitle = {Proceedings of the 23rd International Conference on Principles of
                    Knowledge Representation and Reasoning, {KR} 2026, Lisbon, Portugal,
                    July 20-23, 2026},
  year = {2026},
  doi = {10.24963/KR.2026/40},
  keywords = {preferential logic, dependence logic, cumulative logic, team semantics, knowledge representation, non-monotonic reasoning}
}

@inproceedings{DBLP:conf/csl/0001KM26,
  author = {Fr{\"{o}}hlich, Nicolas and Kolaitis, Phokion G. and Meier, Arne},
  title = {Disjunctions of Two Dependence Atoms},
  booktitle = {34th {EACSL} Annual Conference on Computer Science Logic ({CSL} 2026)},
  series = {LIPIcs},
  volume = {363},
  pages = {10:1--10:21},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year = {2026},
  doi = {10.4230/LIPICS.CSL.2026.10},
  url = {https://doi.org/10.4230/LIPIcs.CSL.2026.10},
  keywords = {dependence logic, team semantics, coherence, model checking, first-order logic}
}

@inproceedings{DBLP:conf/foiks/KrebsM26,
  author = {Krebs, Andreas and Meier, Arne},
  title = {When Symmetry Yields {NP}-Hardness: Affine {ML-SAT} on {S5} Frames},
  booktitle = {Foundations of Information and Knowledge Systems ({FoIKS} 2026)},
  series = {Lecture Notes in Computer Science},
  volume = {16475},
  pages = {232--242},
  publisher = {Springer},
  year = {2026},
  doi = {10.1007/978-3-032-21540-6\_14},
  url = {https://doi.org/10.1007/978-3-032-21540-6_14},
  keywords = {modal logic, satisfiability, affine clones, S5 frames, complexity theory}
}

@inproceedings{DBLP:conf/ijcai/Fichte0HL0MP25,
  author = {Fichte, Johannes Klaus and Fr{\"{o}}hlich, Nicolas and Hecher, Markus and Lagerkvist, Victor and Mahmood, Yasir and Meier, Arne and Persson, Jonathan},
  title = {Facets in Argumentation: {A} Formal Approach to Argument Significance},
  booktitle = {Proceedings of the Thirty-Fourth International Joint Conference on
                 Artificial Intelligence ({IJCAI} 2025)},
  pages = {4491--4499},
  publisher = {ijcai.org},
  year = {2025},
  doi = {10.24963/IJCAI.2025/500},
  url = {https://doi.org/10.24963/ijcai.2025/500},
  keywords = {argumentation, parameterized complexity, facets, complexity theory}
}

@inproceedings{DBLP:conf/kr/0001MPV25,
  author = {Fr{\"{o}}hlich, Nicolas and Meier, Arne and Pardal, Nina and Virtema, Jonni},
  title = {A Logic-Based Framework for Database Repairs},
  booktitle = {22nd International Conference on Principles of Knowledge Representation
                 and Reasoning ({KR} 2025)},
  year = {2025},
  doi = {10.24963/KR.2025/32},
  url = {https://doi.org/10.24963/kr.2025/32},
  keywords = {knowledge representation, dependence logic, team semantics, database repairs, semirings, complexity theory}
}

@inproceedings{DBLP:conf/kr/SauerwaldMK25,
  author = {Sauerwald, Kai and Meier, Arne and Kontinen, Juha},
  title = {On the Complexity and Properties of Preferential Propositional Dependence Logic},
  booktitle = {22nd International Conference on Principles of Knowledge Representation
                 and Reasoning ({KR} 2025)},
  year = {2025},
  doi = {10.24963/KR.2025/51},
  url = {https://doi.org/10.24963/kr.2025/51},
  keywords = {dependence logic, knowledge representation, parameterized complexity, non-monotonic reasoning, team semantics, complexity theory, preferential logic}
}

@inproceedings{DBLP:conf/sofsem/GutlebenM25,
  author = {Gutleben, Jan and Meier, Arne},
  title = {A {SUBSET-SUM} Characterisation of the {A}-Hierarchy},
  booktitle = {{SOFSEM} 2025: Theory and Practice of Computer Science},
  series = {Lecture Notes in Computer Science},
  volume = {15539},
  pages = {31--44},
  publisher = {Springer},
  year = {2025},
  doi = {10.1007/978-3-031-82697-9\_3},
  url = {https://doi.org/10.1007/978-3-031-82697-9_3},
  keywords = {parameterized complexity, counting complexity, A-hierarchy}
}

@inproceedings{DBLP:conf/aaai/FrohlichM24,
  author = {Fr{\"{o}}hlich, Nicolas and Meier, Arne},
  title = {Submodel Enumeration for {CTL} Is Hard},
  booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence ({AAAI} 2024)},
  pages = {10517--10524},
  publisher = {{AAAI} Press},
  year = {2024},
  doi = {10.1609/AAAI.V38I9.28921},
  url = {https://doi.org/10.1609/aaai.v38i9.28921},
  keywords = {modal logic, CTL, enumeration, complexity theory, model checking}
}

@inproceedings{DBLP:conf/ecai/FichteH0M24,
  author = {Fichte, Johannes Klaus and Hecher, Markus and Mahmood, Yasir and Meier, Arne},
  title = {Rejection in Abstract Argumentation: Harder Than Acceptance?},
  booktitle = {{ECAI} 2024 -- 27th European Conference on Artificial Intelligence},
  series = {Frontiers in Artificial Intelligence and Applications},
  volume = {392},
  pages = {3212--3219},
  publisher = {{IOS} Press},
  year = {2024},
  doi = {10.3233/FAIA240867},
  url = {https://doi.org/10.3233/FAIA240867},
  keywords = {argumentation, abstract argumentation, parameterized complexity, complexity theory}
}

@inproceedings{DBLP:conf/ijcai/Hecher0M024,
  author = {Hecher, Markus and Mahmood, Yasir and Meier, Arne and Schmidt, Johannes},
  title = {Quantitative Claim-Centric Reasoning in Logic-Based Argumentation},
  booktitle = {Proceedings of the Thirty-Third International Joint Conference on
                 Artificial Intelligence ({IJCAI} 2024)},
  pages = {3404--3412},
  publisher = {ijcai.org},
  year = {2024},
  url = {https://www.ijcai.org/proceedings/2024/377},
  keywords = {argumentation, counting complexity, parameterized complexity, logic-based argumentation}
}

@inproceedings{DBLP:conf/ijcai/FichteH0M23,
  author = {Fichte, Johannes Klaus and Hecher, Markus and Mahmood, Yasir and Meier, Arne},
  title = {Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation},
  booktitle = {Proceedings of the Thirty-Second International Joint Conference on
                 Artificial Intelligence ({IJCAI} 2023)},
  pages = {3212--3220},
  publisher = {ijcai.org},
  year = {2023},
  doi = {10.24963/IJCAI.2023/358},
  url = {https://doi.org/10.24963/ijcai.2023/358},
  keywords = {argumentation, abstract argumentation, counting complexity, parameterized complexity}
}

@inproceedings{DBLP:conf/jelia/HannulaHKMMV23,
  author = {Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni},
  title = {Logics with Probabilistic Team Semantics and the {Boolean} Negation},
  booktitle = {Logics in Artificial Intelligence ({JELIA} 2023)},
  doi = {10.1007/978-3-031-43619-2\_45},
  url = {https://doi.org/10.1007/978-3-031-43619-2_45},
  series = {Lecture Notes in Computer Science},
  volume = {14281},
  pages = {665--680},
  publisher = {Springer},
  year = {2023},
  journalversion = {DBLP:journals/logcom/HannulaHKMMV25},
  keywords = {team semantics, dependence logic, probabilistic, complexity theory}
}

@inproceedings{DBLP:conf/aiml/FrohlichM22,
  author = {Fr{\"{o}}hlich, Nicolas and Meier, Arne},
  title = {Submodel Enumeration of {Kripke} Structures in Modal Logic},
  booktitle = {Advances in Modal Logic ({AiML} 2022)},
  url = {http://www.aiml.net/volumes/volume14/24-Froehlich-Meier.pdf},
  pages = {391--406},
  publisher = {College Publications},
  year = {2022},
  keywords = {modal logic, enumeration, model checking, complexity theory}
}

@inproceedings{DBLP:conf/lfcs/KontinenMM22,
  author = {Kontinen, Juha and Meier, Arne and Mahmood, Yasir},
  title = {A Parameterized View on the Complexity of Dependence Logic},
  booktitle = {Logical Foundations of Computer Science ({LFCS} 2022)},
  series = {Lecture Notes in Computer Science},
  volume = {13137},
  doi = {10.1007/978-3-030-93100-1\_9},
  url = {https://doi.org/10.1007/978-3-030-93100-1_9},
  pages = {125--142},
  publisher = {Springer},
  year = {2022},
  journalversion = {DBLP:journals/logcom/KontinenMM22},
  keywords = {dependence logic, parameterized complexity, team semantics, first-order logic}
}

@inproceedings{DBLP:conf/lics/GutsfeldMOV22,
  author = {Gutsfeld, Jens Oliver and Meier, Arne and Ohrem, Christoph and Virtema, Jonni},
  title = {Temporal Team Semantics Revisited},
  booktitle = {37th Annual {ACM/IEEE} Symposium on Logic in Computer Science ({LICS} 2022)},
  doi = {10.1145/3531130.3533360},
  url = {https://doi.org/10.1145/3531130.3533360},
  pages = {44:1--44:13},
  publisher = {{ACM}},
  year = {2022},
  keywords = {team semantics, temporal logic, model checking, complexity theory, modal logic, dependence logic}
}

@inproceedings{DBLP:conf/aaai/FichteHM21,
  author = {Fichte, Johannes Klaus and Hecher, Markus and Meier, Arne},
  title = {Knowledge-Base Degrees of Inconsistency: Complexity and Counting},
  booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence ({AAAI} 2021)},
  doi = {10.1609/AAAI.V35I7.16788},
  url = {https://doi.org/10.1609/aaai.v35i7.16788},
  pages = {6349--6357},
  publisher = {{AAAI} Press},
  year = {2021},
  keywords = {argumentation, counting complexity, knowledge representation, complexity theory, abstract argumentation}
}

@inproceedings{DBLP:conf/aaai/0002M021,
  author = {Mahmood, Yasir and Meier, Arne and Schmidt, Johannes},
  title = {Parameterized Complexity of Logic-Based Argumentation in {Schaefer's} Framework},
  booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence ({AAAI} 2021)},
  doi = {10.1609/AAAI.V35I7.16797},
  url = {https://doi.org/10.1609/aaai.v35i7.16797},
  pages = {6426--6434},
  publisher = {{AAAI} Press},
  year = {2021},
  journalversion = {DBLP:journals/tocl/0002M023},
  keywords = {argumentation, logic-based argumentation, parameterized complexity, satisfiability, Post's lattice, Schaefer's framework, complexity theory}
}

@inproceedings{DBLP:conf/ijcai/FichteH0M21,
  author = {Fichte, Johannes Klaus and Hecher, Markus and Mahmood, Yasir and Meier, Arne},
  title = {Decomposition-Guided Reductions for Argumentation and Treewidth},
  booktitle = {Proceedings of the Thirtieth International Joint Conference on
                 Artificial Intelligence ({IJCAI} 2021)},
  doi = {10.24963/IJCAI.2021/259},
  url = {https://doi.org/10.24963/ijcai.2021/259},
  pages = {1880--1886},
  publisher = {ijcai.org},
  year = {2021},
  keywords = {argumentation, abstract argumentation, complexity theory, parameterized complexity}
}

@inproceedings{DBLP:conf/stacs/HaakM0R21,
  author = {Haak, Anselm and Meier, Arne and Prakash, Om and Rao, B. V. Raghavendra},
  title = {Parameterised Counting in Logspace},
  booktitle = {38th International Symposium on Theoretical Aspects of Computer Science ({STACS} 2021)},
  doi = {10.4230/LIPICS.STACS.2021.40},
  url = {https://doi.org/10.4230/LIPIcs.STACS.2021.40},
  series = {LIPIcs},
  volume = {187},
  pages = {40:1--40:17},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year = {2021},
  journalversion = {DBLP:journals/algorithmica/HaakMPR23},
  keywords = {counting complexity, parameterized complexity, logspace, bounded nondeterminism, complexity theory}
}

@inproceedings{DBLP:conf/foiks/0002M20,
  author = {Mahmood, Yasir and Meier, Arne},
  title = {Parameterised Complexity of Model Checking and Satisfiability
                 in Propositional Dependence Logic},
  booktitle = {Foundations of Information and Knowledge Systems ({FoIKS} 2020)},
  series = {Lecture Notes in Computer Science},
  volume = {12012},
  pages = {157--174},
  publisher = {Springer},
  year = {2020},
  doi = {10.1007/978-3-030-39951-1\_10},
  url = {https://doi.org/10.1007/978-3-030-39951-1_10},
  journalversion = {DBLP:journals/amai/MahmoodM22},
  keywords = {propositional, dependence logic, parameterized complexity, model checking, satisfiability, complexity theory}
}

@inproceedings{DBLP:conf/lfcs/0002M020,
  author = {Mahmood, Yasir and Meier, Arne and Schmidt, Johannes},
  title = {Parameterised Complexity of Abduction in {Schaefer's} Framework},
  booktitle = {Logical Foundations of Computer Science ({LFCS} 2020)},
  series = {Lecture Notes in Computer Science},
  volume = {11972},
  pages = {195--213},
  publisher = {Springer},
  year = {2020},
  doi = {10.1007/978-3-030-36755-8\_13},
  url = {https://doi.org/10.1007/978-3-030-36755-8_13},
  journalversion = {DBLP:journals/logcom/MahmoodMS21},
  keywords = {parameterized complexity, satisfiability, abduction, complexity theory, Post's lattice, Schaefer's framework, non-monotonic reasoning}
}

@inproceedings{DBLP:conf/aaai/FichteHM19,
  author = {Fichte, Johannes Klaus and Hecher, Markus and Meier, Arne},
  title = {Counting Complexity for Reasoning in Abstract Argumentation},
  booktitle = {Thirty-Third {AAAI} Conference on Artificial Intelligence ({AAAI} 2019)},
  pages = {2827--2834},
  publisher = {{AAAI} Press},
  year = {2019},
  doi = {10.1609/AAAI.V33I01.33012827},
  url = {https://doi.org/10.1609/aaai.v33i01.33012827},
  journalversion = {DBLP:journals/jair/FichteHM24},
  keywords = {argumentation, abstract argumentation, counting complexity, parameterized complexity, complexity theory}
}

@inproceedings{DBLP:conf/foiks/0001HKMV18,
  author = {Durand, Arnaud and Hannula, Miika and Kontinen, Juha and Meier, Arne and Virtema, Jonni},
  title = {Probabilistic Team Semantics},
  booktitle = {Foundations of Information and Knowledge Systems ({FoIKS} 2018)},
  series = {Lecture Notes in Computer Science},
  volume = {10833},
  pages = {186--206},
  publisher = {Springer},
  year = {2018},
  doi = {10.1007/978-3-319-90050-6\_11},
  url = {https://doi.org/10.1007/978-3-319-90050-6_11},
  keywords = {team semantics, probabilistic logic, dependence logic, complexity theory, first-order logic}
}

@inproceedings{DBLP:conf/foiks/MeierR18,
  author = {Meier, Arne and Reinbold, Christian},
  title = {Enumeration Complexity of Poor Man's Propositional Dependence Logic},
  booktitle = {Foundations of Information and Knowledge Systems ({FoIKS} 2018)},
  series = {Lecture Notes in Computer Science},
  volume = {10833},
  pages = {303--321},
  publisher = {Springer},
  year = {2018},
  doi = {10.1007/978-3-319-90050-6\_17},
  url = {https://doi.org/10.1007/978-3-319-90050-6_17},
  keywords = {dependence logic, enumeration, team semantics, complexity theory}
}

@inproceedings{DBLP:conf/mfcs/KrebsMV018,
  author = {Krebs, Andreas and Meier, Arne and Virtema, Jonni and Zimmermann, Martin},
  title = {Team Semantics for the Specification and Verification of Hyperproperties},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science ({MFCS} 2018)},
  series = {LIPIcs},
  volume = {117},
  pages = {10:1--10:16},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year = {2018},
  doi = {10.4230/LIPICS.MFCS.2018.10},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.10},
  keywords = {team semantics, temporal logic, model checking, complexity theory}
}

@inproceedings{DBLP:conf/mfcs/HellaKMV17,
  author = {Hella, Lauri and Kuusisto, Antti and Meier, Arne and Virtema, Jonni},
  title = {Model Checking and Validity in Propositional and Modal Inclusion Logics},
  booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science ({MFCS} 2017)},
  series = {LIPIcs},
  volume = {83},
  pages = {32:1--32:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year = {2017},
  doi = {10.4230/LIPICS.MFCS.2017.32},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2017.32},
  journalversion = {DBLP:journals/logcom/HellaKMV19},
  keywords = {modal logic, inclusion logic, model checking, team semantics, complexity theory, validity}
}

@inproceedings{DBLP:conf/foiks/0001HKMV16,
  author = {Durand, Arnaud and Hannula, Miika and Kontinen, Juha and Meier, Arne and Virtema, Jonni},
  title = {Approximation and Dependence via Multiteam Semantics},
  booktitle = {Foundations of Information and Knowledge Systems ({FoIKS} 2016)},
  series = {Lecture Notes in Computer Science},
  volume = {9616},
  pages = {271--291},
  publisher = {Springer},
  year = {2016},
  doi = {10.1007/978-3-319-30024-5\_15},
  url = {https://doi.org/10.1007/978-3-319-30024-5_15},
  journalversion = {DBLP:journals/amai/DurandHKMV18},
  keywords = {team semantics, dependence logic, probabilistic logic, complexity theory, first-order logic}
}

@inproceedings{DBLP:conf/iwpec/MeierOSS16,
  author = {Meier, Arne and Ordyniak, Sebastian and Sridharan, Ramanujan and Schindler, Irena},
  title = {Backdoors for Linear Temporal Logic},
  booktitle = {11th International Symposium on Parameterized and Exact Computation ({IPEC} 2016)},
  series = {LIPIcs},
  volume = {63},
  pages = {23:1--23:17},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year = {2016},
  doi = {10.4230/LIPICS.IPEC.2016.23},
  url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.23},
  journalversion = {DBLP:journals/algorithmica/MeierORS19},
  keywords = {temporal logic, parameterized complexity, backdoors, complexity theory, LTL}
}

@inproceedings{DBLP:conf/sat/FichteMS16,
  author = {Fichte, Johannes Klaus and Meier, Arne and Schindler, Irina},
  title = {Strong Backdoors for Default Logic},
  booktitle = {Theory and Applications of Satisfiability Testing ({SAT} 2016)},
  series = {Lecture Notes in Computer Science},
  volume = {9710},
  pages = {45--59},
  publisher = {Springer},
  year = {2016},
  doi = {10.1007/978-3-319-40970-2\_4},
  url = {https://doi.org/10.1007/978-3-319-40970-2_4},
  journalversion = {DBLP:journals/tocl/FichteMS24},
  keywords = {default logic, parameterized complexity, backdoors, non-monotonic reasoning, complexity theory}
}

@inproceedings{DBLP:conf/lata/CreignouKMMOV15,
  author = {Creignou, Nadia and Ktari, Ra{\"{i}}da and Meier, Arne and M{\"{u}}ller, Julian{-}Steffen and Olive, Fr{\'{e}}d{\'{e}}ric and Vollmer, Heribert},
  title = {Parameterized Enumeration for Modification Problems},
  booktitle = {Language and Automata Theory and Applications ({LATA} 2015)},
  series = {Lecture Notes in Computer Science},
  volume = {8977},
  pages = {524--536},
  publisher = {Springer},
  year = {2015},
  doi = {10.1007/978-3-319-15579-1\_41},
  url = {https://doi.org/10.1007/978-3-319-15579-1_41},
  journalversion = {DBLP:journals/algorithms/CreignouKMMOV19},
  keywords = {enumeration, parameterized complexity, complexity theory}
}

@inproceedings{DBLP:conf/lata/LuckMS15,
  author = {L{\"{u}}ck, Martin and Meier, Arne and Schindler, Irina},
  title = {Parameterized Complexity of {CTL} -- A Generalization of {Courcelle's} Theorem},
  booktitle = {Language and Automata Theory and Applications ({LATA} 2015)},
  series = {Lecture Notes in Computer Science},
  volume = {8977},
  pages = {549--560},
  publisher = {Springer},
  year = {2015},
  doi = {10.1007/978-3-319-15579-1\_43},
  url = {https://doi.org/10.1007/978-3-319-15579-1_43},
  journalversion = {DBLP:journals/tocl/LuckMS17},
  keywords = {modal logic, CTL, parameterized complexity}
}

@inproceedings{DBLP:conf/mfcs/HellaKMV15,
  author = {Hella, Lauri and Kuusisto, Antti and Meier, Arne and Vollmer, Heribert},
  title = {Modal Inclusion Logic: Being Lax is Simpler than Being Strict},
  booktitle = {Mathematical Foundations of Computer Science ({MFCS} 2015)},
  series = {Lecture Notes in Computer Science},
  volume = {9234},
  pages = {281--292},
  publisher = {Springer},
  year = {2015},
  doi = {10.1007/978-3-662-48057-1\_22},
  url = {https://doi.org/10.1007/978-3-662-48057-1_22},
  journalversion = {DBLP:journals/tocl/HellaKMV20},
  keywords = {modal logic, inclusion logic, team semantics, complexity theory}
}

@inproceedings{DBLP:conf/time/LuckM15,
  author = {L{\"{u}}ck, Martin and Meier, Arne},
  title = {{LTL} Fragments are Hard for Standard Parameterisations},
  booktitle = {22nd International Symposium on Temporal Representation and Reasoning ({TIME} 2015)},
  pages = {59--68},
  publisher = {{IEEE} Computer Society},
  year = {2015},
  doi = {10.1109/TIME.2015.9},
  url = {https://doi.org/10.1109/TIME.2015.9},
  journalversion = {DBLP:journals/tocl/LuckMS17},
  keywords = {temporal logic, parameterized complexity, LTL}
}

@inproceedings{DBLP:conf/time/KrebsMM15,
  author = {Krebs, Andreas and Meier, Arne and Mundhenk, Martin},
  title = {The Model Checking Fingerprints of {CTL} Operators},
  booktitle = {22nd International Symposium on Temporal Representation and Reasoning ({TIME} 2015)},
  pages = {101--110},
  publisher = {{IEEE} Computer Society},
  year = {2015},
  doi = {10.1109/TIME.2015.13},
  url = {https://doi.org/10.1109/TIME.2015.13},
  journalversion = {DBLP:journals/acta/KrebsMM19},
  keywords = {model checking, CTL, modal logic, complexity theory, Post's lattice}
}

@inproceedings{DBLP:conf/time/KrebsMV15,
  author = {Krebs, Andreas and Meier, Arne and Virtema, Jonni},
  title = {A Team Based Variant of {CTL}},
  booktitle = {22nd International Symposium on Temporal Representation and Reasoning ({TIME} 2015)},
  pages = {140--149},
  publisher = {{IEEE} Computer Society},
  year = {2015},
  doi = {10.1109/TIME.2015.11},
  url = {https://doi.org/10.1109/TIME.2015.11},
  journalversion = {DBLP:journals/tocl/KrebsMV17},
  keywords = {team semantics, CTL, temporal logic, complexity theory}
}

@inproceedings{DBLP:conf/mfcs/CreignouMMSV13,
  author = {Creignou, Nadia and Meier, Arne and M{\"{u}}ller, Julian{-}Steffen and Schmidt, Johannes and Vollmer, Heribert},
  title = {Paradigms for Parameterized Enumeration},
  booktitle = {Mathematical Foundations of Computer Science ({MFCS} 2013)},
  series = {Lecture Notes in Computer Science},
  volume = {8087},
  pages = {290--301},
  publisher = {Springer},
  year = {2013},
  doi = {10.1007/978-3-642-40313-2\_27},
  url = {https://doi.org/10.1007/978-3-642-40313-2_27},
  journalversion = {DBLP:journals/mst/CreignouMMSV17},
  keywords = {enumeration, parameterized complexity, complexity theory, kernelization, self-reducibility, backdoors}
}

@inproceedings{DBLP:conf/wollic/EbbingHMMVV13,
  author = {Ebbing, Johannes and Hella, Lauri and Meier, Arne and M{\"{u}}ller, Julian{-}Steffen and Virtema, Jonni and Vollmer, Heribert},
  title = {Extended Modal Dependence Logic},
  booktitle = {Logic, Language, Information, and Computation ({WoLLIC} 2013)},
  series = {Lecture Notes in Computer Science},
  volume = {8071},
  pages = {126--137},
  publisher = {Springer},
  year = {2013},
  doi = {10.1007/978-3-642-39992-3\_13},
  url = {https://doi.org/10.1007/978-3-642-39992-3_13},
  keywords = {modal logic, dependence logic, team semantics, complexity theory}
}

@inproceedings{DBLP:conf/aiml/GollerMM0TW12,
  author = {G{\"{o}}ller, Stefan and Meier, Arne and Mundhenk, Martin and Schneider, Thomas and Thomas, Michael and Wei{\ss}, Felix},
  title = {The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers},
  url = {http://www.aiml.net/volumes/volume9/Goeller-Meier-Mundhenk-Schneider-Thomas-Weiss.pdf},
  booktitle = {Advances in Modal Logic ({AiML} 2012)},
  pages = {261--278},
  publisher = {College Publications},
  year = {2012},
  keywords = {modal logic, hybrid logic, satisfiability, monotone frames, complexity theory}
}

@inproceedings{DBLP:conf/lata/MeierSTV12,
  author = {Meier, Arne and Schmidt, Johannes and Thomas, Michael and Vollmer, Heribert},
  title = {On the Parameterized Complexity of Default Logic and Autoepistemic Logic},
  booktitle = {Language and Automata Theory and Applications ({LATA} 2012)},
  series = {Lecture Notes in Computer Science},
  volume = {7183},
  pages = {389--400},
  publisher = {Springer},
  year = {2012},
  doi = {10.1007/978-3-642-28332-1\_33},
  url = {https://doi.org/10.1007/978-3-642-28332-1_33},
  keywords = {default logic, parameterized complexity, non-monotonic reasoning, complexity theory, autoepistemic logic}
}

@inproceedings{DBLP:conf/tamc/MeierS11,
  author = {Meier, Arne and Schneider, Thomas},
  title = {Generalized Satisfiability for the Description Logic {ALC}},
  booktitle = {Theory and Applications of Models of Computation ({TAMC} 2011)},
  series = {Lecture Notes in Computer Science},
  volume = {6648},
  pages = {552--562},
  publisher = {Springer},
  year = {2011},
  doi = {10.1007/978-3-642-20877-5\_53},
  url = {https://doi.org/10.1007/978-3-642-20877-5_53},
  journalversion = {DBLP:journals/tcs/Meier013},
  keywords = {description logic, ALC, satisfiability, complexity theory, Post's lattice}
}

@inproceedings{DBLP:conf/sat/BeyersdorffMMTV10,
  author = {Beyersdorff, Olaf and Meier, Arne and M{\"{u}}ller, Sebastian and Thomas, Michael and Vollmer, Heribert},
  title = {Proof Complexity of Propositional Default Logic},
  booktitle = {Theory and Applications of Satisfiability Testing ({SAT} 2010)},
  series = {Lecture Notes in Computer Science},
  volume = {6175},
  pages = {30--43},
  publisher = {Springer},
  year = {2010},
  doi = {10.1007/978-3-642-14186-7\_5},
  url = {https://doi.org/10.1007/978-3-642-14186-7_5},
  journalversion = {DBLP:journals/aml/BeyersdorffMMTV11},
  keywords = {default logic, proof complexity, satisfiability, non-monotonic reasoning}
}

@inproceedings{DBLP:conf/mfcs/MeierMSTWW09,
  author = {Meier, Arne and Mundhenk, Martin and Schneider, Thomas and Thomas, Michael and Weber, Volker and Weiss, Felix},
  title = {The Complexity of Satisfiability for Fragments of Hybrid Logic -- {Part I}},
  booktitle = {Mathematical Foundations of Computer Science ({MFCS} 2009)},
  series = {Lecture Notes in Computer Science},
  volume = {5734},
  pages = {587--599},
  publisher = {Springer},
  year = {2009},
  doi = {10.1007/978-3-642-03816-7\_50},
  url = {https://doi.org/10.1007/978-3-642-03816-7_50},
  journalversion = {DBLP:journals/japll/MeierMSTWW10},
  keywords = {modal logic, hybrid logic, satisfiability, Post's lattice, complexity theory}
}

@inproceedings{DBLP:conf/sat/BeyersdorffMTV09,
  author = {Beyersdorff, Olaf and Meier, Arne and Thomas, Michael and Vollmer, Heribert},
  title = {The Complexity of Reasoning for Fragments of Default Logic},
  booktitle = {Theory and Applications of Satisfiability Testing ({SAT} 2009)},
  series = {Lecture Notes in Computer Science},
  volume = {5584},
  pages = {51--64},
  publisher = {Springer},
  year = {2009},
  doi = {10.1007/978-3-642-02777-2\_7},
  url = {https://doi.org/10.1007/978-3-642-02777-2_7},
  journalversion = {DBLP:journals/logcom/BeyersdorffMTV12},
  keywords = {default logic, satisfiability, non-monotonic reasoning, complexity theory, Post's lattice}
}

@inproceedings{DBLP:conf/time/BeyersdorffMTVMS09,
  author = {Beyersdorff, Olaf and Meier, Arne and Thomas, Michael and Vollmer, Heribert and Mundhenk, Martin and Schneider, Thomas},
  title = {Model Checking {CTL} is Almost Always Inherently Sequential},
  booktitle = {16th International Symposium on Temporal Representation and Reasoning ({TIME} 2009)},
  pages = {21--28},
  publisher = {{IEEE} Computer Society},
  year = {2009},
  doi = {10.1109/TIME.2009.12},
  url = {https://doi.org/10.1109/TIME.2009.12},
  journalversion = {DBLP:journals/corr/abs-1103-4990},
  keywords = {model checking, CTL, circuit complexity, complexity theory, Post's lattice, temporal logic}
}

@inproceedings{DBLP:journals/entcs/MeierMTV08,
  author = {Meier, Arne and Mundhenk, Martin and Thomas, Michael and Vollmer, Heribert},
  title = {The Complexity of Satisfiability for Fragments of {CTL} and {CTL*}},
  booktitle = {Second Workshop on Reachability Problems in Computational Models ({RP} 2008)},
  series = {Electronic Notes in Theoretical Computer Science},
  volume = {223},
  pages = {201--213},
  publisher = {Elsevier},
  year = {2008},
  doi = {10.1016/J.ENTCS.2008.12.040},
  url = {https://doi.org/10.1016/j.entcs.2008.12.040},
  journalversion = {DBLP:journals/ijfcs/MeierTVM09},
  keywords = {modal logic, CTL, CTL*, satisfiability, complexity theory, Post's lattice, temporal logic}
}

@article{GUTSFELD2027103859,
  author = {Gutsfeld, Jens Oliver and Ohrem, Christoph and Meier, Arne and Virtema, Jonni},
  doi = {https://doi.org/10.1016/j.jcss.2026.103859},
  issn = {0022-0000},
  journal = {Journal of Computer and System Sciences},
  keywords = {Team semantics, Temporal logic, Hyperproperties, Automata theory, Model checking, Asynchronicity},
  pages = {103859},
  title = {Temporal team semantics revisited},
  url = {https://www.sciencedirect.com/science/article/pii/S0022000026001054},
  volume = {163},
  year = {2027},
  confversion = {DBLP:conf/lics/GutsfeldMOV22}
}

@article{DBLP:journals/logcom/HannulaHKMMV25,
  author = {Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni},
  title = {Logics with probabilistic team semantics and the {Boolean} negation},
  journal = {J. Log. Comput.},
  volume = {35},
  number = {3},
  year = {2025},
  doi = {10.1093/LOGCOM/EXAF021},
  url = {https://doi.org/10.1093/logcom/exaf021},
  confversion = {DBLP:conf/jelia/HannulaHKMMV23},
  keywords = {team semantics, dependence logic, probabilistic logic, complexity theory}
}

@article{DBLP:journals/jair/FichteHM24,
  author = {Fichte, Johannes Klaus and Hecher, Markus and Meier, Arne},
  title = {Counting Complexity for Reasoning in Abstract Argumentation},
  journal = {J. Artif. Intell. Res.},
  volume = {80},
  year = {2024},
  doi = {10.1613/JAIR.1.16210},
  url = {https://doi.org/10.1613/jair.1.16210},
  confversion = {DBLP:conf/aaai/FichteHM19},
  keywords = {argumentation, abstract argumentation, counting complexity, parameterized complexity, complexity theory}
}

@article{DBLP:journals/mscs/KontinenMMV24,
  author = {Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Vollmer, Heribert},
  title = {Parameterized complexity of weighted team definability},
  journal = {Math. Struct. Comput. Sci.},
  volume = {34},
  number = {5},
  pages = {375--389},
  year = {2024},
  doi = {10.1017/S0960129524000033},
  url = {https://doi.org/10.1017/s0960129524000033},
  keywords = {team semantics, parameterized complexity, dependence logic, W-hierarchy, first-order logic}
}

@article{DBLP:journals/tocl/FichteMS24,
  author = {Fichte, Johannes Klaus and Meier, Arne and Schindler, Irena},
  title = {Strong Backdoors for Default Logic},
  journal = {{ACM} Trans. Comput. Log.},
  volume = {25},
  number = {3},
  pages = {1--24},
  year = {2024},
  doi = {10.1145/3655024},
  url = {https://doi.org/10.1145/3655024},
  confversion = {DBLP:conf/sat/FichteMS16},
  keywords = {default logic, parameterized complexity, backdoors, complexity theory, non-monotonic reasoning}
}

@article{DBLP:journals/algorithmica/HaakMPR23,
  author = {Haak, Anselm and Meier, Arne and Prakash, Om and Rao, B. V. Raghavendra},
  title = {Parameterised Counting in Logspace},
  journal = {Algorithmica},
  volume = {85},
  number = {10},
  pages = {2923--2961},
  year = {2023},
  doi = {10.1007/S00453-023-01114-2},
  url = {https://doi.org/10.1007/s00453-023-01114-2},
  confversion = {DBLP:conf/stacs/HaakM0R21},
  keywords = {counting complexity, parameterized complexity, logspace, bounded nondeterminism, complexity theory}
}

@article{DBLP:journals/tocl/0002M023,
  author = {Mahmood, Yasir and Meier, Arne and Schmidt, Johannes},
  title = {Parameterized Complexity of Logic-based Argumentation in {Schaefer's} Framework},
  journal = {{ACM} Trans. Comput. Log.},
  volume = {24},
  number = {3},
  pages = {26:1--26:25},
  year = {2023},
  doi = {10.1145/3582499},
  url = {https://doi.org/10.1145/3582499},
  confversion = {DBLP:conf/aaai/0002M021},
  keywords = {argumentation, parameterized complexity, satisfiability, Post's lattice, Schaefer's framework, complexity theory, logic-based argumentation}
}

@article{DBLP:journals/amai/MahmoodM22,
  author = {Mahmood, Yasir and Meier, Arne},
  title = {Parameterised complexity of model checking and satisfiability
                in propositional dependence logic},
  journal = {Ann. Math. Artif. Intell.},
  doi = {10.1007/S10472-021-09730-W},
  volume = {90},
  number = {2-3},
  pages = {271--296},
  year = {2022},
  confversion = {DBLP:conf/foiks/0002M20},
  keywords = {propositional, dependence logic, parameterized complexity, model checking, satisfiability, complexity theory}
}

@article{DBLP:journals/apal/HaakMMV22,
  author = {Haak, Anselm and Meier, Arne and M{\"{u}}ller, Fabian and Vollmer, Heribert},
  title = {Enumerating teams in first-order team logics},
  journal = {Ann. Pure Appl. Log.},
  doi = {10.1016/J.APAL.2022.103163},
  volume = {173},
  number = {10},
  pages = {103163},
  year = {2022},
  keywords = {team semantics, enumeration, first-order logic, complexity theory}
}

@article{DBLP:journals/logcom/KontinenMM22,
  author = {Kontinen, Juha and Meier, Arne and Mahmood, Yasir},
  title = {A parameterized view on the complexity of dependence and independence logic},
  journal = {J. Log. Comput.},
  doi = {10.1093/LOGCOM/EXAC070},
  volume = {32},
  number = {8},
  pages = {1624--1644},
  year = {2022},
  confversion = {DBLP:conf/lfcs/KontinenMM22},
  keywords = {dependence logic, parameterized complexity, team semantics, first-order logic}
}

@article{DBLP:journals/logcom/MahmoodMS21,
  author = {Mahmood, Yasir and Meier, Arne and Schmidt, Johannes},
  title = {Parameterized complexity of abduction in {Schaefer's} framework},
  journal = {J. Log. Comput.},
  doi = {10.1093/LOGCOM/EXAA079},
  volume = {31},
  number = {1},
  pages = {266--296},
  year = {2021},
  confversion = {DBLP:conf/lfcs/0002M020},
  keywords = {parameterized complexity, satisfiability, abduction, complexity theory, Post's lattice, Schaefer's framework, non-monotonic reasoning}
}

@article{DBLP:journals/algorithms/Meier20,
  author = {Meier, Arne},
  title = {Incremental {FPT} Delay},
  journal = {Algorithms},
  doi = {10.3390/A13050122},
  volume = {13},
  number = {5},
  pages = {122},
  year = {2020},
  keywords = {enumeration, parameterized complexity, complexity theory, function complexity, FPT, delay}
}

@article{DBLP:journals/tocl/HellaKMV20,
  author = {Hella, Lauri and Kuusisto, Antti and Meier, Arne and Vollmer, Heribert},
  title = {Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics},
  journal = {{ACM} Trans. Comput. Log.},
  doi = {10.1145/3356043},
  volume = {21},
  number = {1},
  pages = {7:1--7:18},
  year = {2020},
  confversion = {DBLP:conf/mfcs/HellaKMV15},
  keywords = {modal logic, inclusion logic, team semantics, complexity theory}
}

@article{DBLP:journals/acta/KrebsMM19,
  author = {Krebs, Andreas and Meier, Arne and Mundhenk, Martin},
  title = {The model checking fingerprints of {CTL} operators},
  journal = {Acta Informatica},
  doi = {10.1007/S00236-018-0326-9},
  volume = {56},
  number = {6},
  pages = {487--519},
  year = {2019},
  confversion = {DBLP:conf/time/KrebsMM15},
  keywords = {model checking, CTL, modal logic, complexity theory, Post's lattice}
}

@article{DBLP:journals/algorithmica/MeierORS19,
  author = {Meier, Arne and Ordyniak, Sebastian and Ramanujan, M. S. and Schindler, Irena},
  title = {Backdoors for Linear Temporal Logic},
  journal = {Algorithmica},
  doi = {10.1007/S00453-018-0515-5},
  volume = {81},
  number = {2},
  pages = {476--496},
  year = {2019},
  confversion = {DBLP:conf/iwpec/MeierOSS16},
  keywords = {temporal logic, parameterized complexity, backdoors, complexity theory, LTL}
}

@article{DBLP:journals/algorithms/CreignouKMMOV19,
  author = {Creignou, Nadia and Ktari, Ra{\"{i}}da and Meier, Arne and M{\"{u}}ller, Julian{-}Steffen and Olive, Fr{\'{e}}d{\'{e}}ric and Vollmer, Heribert},
  title = {Parameterised Enumeration for Modification Problems},
  doi = {10.3390/A12090189},
  journal = {Algorithms},
  volume = {12},
  number = {9},
  pages = {189},
  year = {2019},
  confversion = {DBLP:conf/lata/CreignouKMMOV15},
  keywords = {enumeration, parameterized complexity, complexity theory}
}

@article{DBLP:journals/logcom/HellaKMV19,
  author = {Hella, Lauri and Kuusisto, Antti and Meier, Arne and Virtema, Jonni},
  title = {Model checking and validity in propositional and modal inclusion logics},
  journal = {J. Log. Comput.},
  doi = {10.1093/LOGCOM/EXZ008},
  volume = {29},
  number = {5},
  pages = {605--630},
  year = {2019},
  confversion = {DBLP:conf/mfcs/HellaKMV17},
  keywords = {modal logic, inclusion logic, model checking, team semantics, complexity theory, validity}
}

@article{DBLP:journals/amai/DurandHKMV18,
  author = {Durand, Arnaud and Hannula, Miika and Kontinen, Juha and Meier, Arne and Virtema, Jonni},
  title = {Approximation and dependence via multiteam semantics},
  doi = {10.1007/S10472-017-9568-4},
  journal = {Ann. Math. Artif. Intell.},
  volume = {83},
  number = {3-4},
  pages = {297--320},
  year = {2018},
  confversion = {DBLP:conf/foiks/0001HKMV16},
  keywords = {team semantics, dependence logic, probabilistic logic, complexity theory, first-order logic}
}

@article{DBLP:journals/mst/CreignouMMSV17,
  author = {Creignou, Nadia and Meier, Arne and M{\"{u}}ller, Julian{-}Steffen and Schmidt, Johannes and Vollmer, Heribert},
  title = {Paradigms for Parameterized Enumeration},
  doi = {10.1007/S00224-016-9702-4},
  journal = {Theory Comput. Syst.},
  volume = {60},
  number = {4},
  pages = {737--758},
  year = {2017},
  confversion = {DBLP:conf/mfcs/CreignouMMSV13},
  keywords = {enumeration, parameterized complexity, complexity theory}
}

@article{DBLP:journals/tocl/LuckMS17,
  author = {L{\"{u}}ck, Martin and Meier, Arne and Schindler, Irena},
  title = {Parametrised Complexity of Satisfiability in Temporal Logic},
  journal = {{ACM} Trans. Comput. Log.},
  doi = {10.1145/3001835},
  volume = {18},
  number = {1},
  pages = {1:1--1:32},
  year = {2017},
  confversion = {DBLP:conf/lata/LuckMS15},
  keywords = {temporal logic, parameterized complexity, satisfiability, complexity theory}
}

@article{DBLP:journals/aml/MeierS0TV15,
  author = {Meier, Arne and Schindler, Irina and Schmidt, Johannes and Thomas, Michael and Vollmer, Heribert},
  title = {On the parameterized complexity of non-monotonic logics},
  doi = {10.1007/S00153-015-0435-X},
  journal = {Arch. Math. Log.},
  volume = {54},
  number = {5-6},
  pages = {685--710},
  year = {2015},
  keywords = {default logic, parameterized complexity, non-monotonic reasoning, complexity theory, abduction, autoepistemic logic, circumscription, MSO}
}

@article{DBLP:journals/ijfcs/MeierTVM15,
  author = {Meier, Arne and Thomas, Michael and Vollmer, Heribert and Mundhenk, Martin},
  title = {Erratum: The Complexity of Satisfiability for Fragments of {CTL} and {CTL*}},
  journal = {Int. J. Found. Comput. Sci.},
  doi = {10.1142/S012905411592001X},
  url = {https://doi.org/10.1142/S012905411592001X},
  volume = {26},
  number = {8},
  pages = {1189},
  year = {2015},
  erratumof = {DBLP:journals/ijfcs/MeierTVM09},
  keywords = {modal logic, CTL, satisfiability, complexity theory, Post's lattice, temporal logic}
}

@article{DBLP:journals/tcs/Meier013,
  author = {Meier, Arne and Schneider, Thomas},
  title = {Generalized satisfiability for the description logic {ALC}},
  journal = {Theor. Comput. Sci.},
  doi = {10.1016/J.TCS.2013.02.009},
  volume = {505},
  pages = {55--73},
  year = {2013},
  confversion = {DBLP:conf/tamc/MeierS11},
  keywords = {description logic, ALC, satisfiability, complexity theory, Post's lattice}
}

@article{DBLP:journals/eatcs/MeierMMV12,
  author = {Meier, Arne and M{\"{u}}ller, Julian{-}Steffen and Mundhenk, Martin and Vollmer, Heribert},
  title = {Complexity of Model Checking for Logics over {Kripke} models},
  journal = {Bull. {EATCS}},
  volume = {108},
  pages = {49--89},
  year = {2012},
  url = {https://eatcs.org/images/bulletin/beatcs108.pdf},
  keywords = {model checking, modal logic, CTL, Post's lattice, complexity theory, temporal logic, hybrid logic, intuistionistic logic, LTL, CTL*, modal dependence logic, modal logic, dependence logic}
}

@article{DBLP:journals/logcom/BeyersdorffMTV12,
  author = {Beyersdorff, Olaf and Meier, Arne and Thomas, Michael and Vollmer, Heribert},
  title = {The complexity of reasoning for fragments of default logic},
  journal = {J. Log. Comput.},
  volume = {22},
  number = {3},
  pages = {587--604},
  year = {2012},
  doi = {10.1093/LOGCOM/EXQ061},
  url = {https://doi.org/10.1093/logcom/exq061},
  confversion = {DBLP:conf/sat/BeyersdorffMTV09},
  keywords = {default logic, satisfiability, non-monotonic reasoning, complexity theory, Post's lattice}
}

@article{DBLP:journals/tocl/CreignouMVT12,
  author = {Creignou, Nadia and Meier, Arne and Vollmer, Heribert and Thomas, Michael},
  title = {The Complexity of Reasoning for Fragments of Autoepistemic Logic},
  journal = {{ACM} Trans. Comput. Log.},
  volume = {13},
  number = {2},
  pages = {17:1--17:22},
  year = {2012},
  doi = {10.1145/2159531.2159539},
  url = {https://doi.org/10.1145/2159531.2159539},
  keywords = {non-monotonic reasoning, satisfiability, parameterized complexity, complexity theory, autoepistemic logic, Post's lattice}
}

@article{DBLP:journals/aml/BeyersdorffMMTV11,
  author = {Beyersdorff, Olaf and Meier, Arne and M{\"{u}}ller, Sebastian and Thomas, Michael and Vollmer, Heribert},
  title = {Proof complexity of propositional default logic},
  journal = {Arch. Math. Log.},
  volume = {50},
  number = {7-8},
  pages = {727--742},
  year = {2011},
  doi = {10.1007/S00153-011-0245-8},
  url = {https://doi.org/10.1007/s00153-011-0245-8},
  confversion = {DBLP:conf/sat/BeyersdorffMMTV10},
  keywords = {default logic, proof complexity, satisfiability, non-monotonic reasoning}
}

@article{DBLP:journals/corr/abs-1103-4990,
  author = {Beyersdorff, Olaf and Meier, Arne and Mundhenk, Martin and Schneider, Thomas and Thomas, Michael and Vollmer, Heribert},
  title = {Model Checking {CTL} is Almost Always Inherently Sequential},
  journal = {Log. Methods Comput. Sci.},
  volume = {7},
  number = {2},
  year = {2011},
  doi = {10.2168/LMCS-7(2:12)2011},
  url = {https://doi.org/10.2168/LMCS-7(2:12)2011},
  confversion = {DBLP:conf/time/BeyersdorffMTVMS09},
  keywords = {model checking, CTL, circuit complexity, complexity theory, Post's lattice, temporal logic}
}

@article{DBLP:journals/japll/MeierMSTWW10,
  author = {Meier, Arne and Mundhenk, Martin and Schneider, Thomas and Thomas, Michael and Weber, Volker and Weiss, Felix},
  title = {The complexity of satisfiability for fragments of hybrid logic - {Part I}},
  journal = {J. Appl. Log.},
  volume = {8},
  number = {4},
  pages = {409--421},
  year = {2010},
  doi = {10.1016/J.JAL.2010.08.001},
  url = {https://doi.org/10.1016/j.jal.2010.08.001},
  confversion = {DBLP:conf/mfcs/MeierMSTWW09},
  keywords = {modal logic, hybrid logic, satisfiability, Post's lattice, complexity theory}
}

@article{DBLP:journals/ijfcs/MeierTVM09,
  author = {Meier, Arne and Thomas, Michael and Vollmer, Heribert and Mundhenk, Martin},
  title = {The Complexity of Satisfiability for Fragments of {CTL} and {CTL*}},
  journal = {Int. J. Found. Comput. Sci.},
  volume = {20},
  number = {5},
  pages = {901--918},
  year = {2009},
  doi = {10.1142/S0129054109006954},
  url = {https://doi.org/10.1142/S0129054109006954},
  confversion = {DBLP:journals/entcs/MeierMTV08},
  erratum = {DBLP:journals/ijfcs/MeierTVM15},
  keywords = {modal logic, CTL, CTL*, satisfiability, complexity theory, Post's lattice, temporal logic}
}

@article{DBLP:journals/ipl/BeyersdorffMTV09,
  author = {Beyersdorff, Olaf and Meier, Arne and Thomas, Michael and Vollmer, Heribert},
  title = {The complexity of propositional implication},
  journal = {Inf. Process. Lett.},
  volume = {109},
  number = {18},
  pages = {1071--1077},
  year = {2009},
  doi = {10.1016/J.IPL.2009.06.015},
  url = {https://doi.org/10.1016/j.ipl.2009.06.015},
  keywords = {satisfiability, proof complexity, implication, Post's lattice, complexity theory}
}

@proceedings{DBLP:conf/foiks/2024,
  editor = {Meier, Arne and Ortiz, Magdalena},
  title = {Foundations of Information and Knowledge Systems - 13th International
                    Symposium, FoIKS 2024, Sheffield, UK, April 8-11, 2024, Proceedings},
  series = {Lecture Notes in Computer Science},
  volume = {14589},
  publisher = {Springer},
  year = {2024},
  url = {https://doi.org/10.1007/978-3-031-56940-1},
  doi = {10.1007/978-3-031-56940-1},
  isbn = {978-3-031-56939-5},
  keywords = {Proceedings, Foreword}
}

@misc{DBLP:books/dnb/MeierM20,
  author = {Meier, Arne},
  date-added = {2022-03-31 12:31:09 +0200},
  date-modified = {2022-11-17 21:23:23 +0200},
  doi = {10.15488/9427},
  howpublished = {Habilitation thesis, Leibniz Universität Hannover, Institut f\"ur Theoretische Informatik},
  title = {Parametrised enumeration},
  year = {2020},
  keywords = {parameterized complexity, enumeration},
  url = {https://doi.org/10.15488/9427}
}

@book{DBLP:books/daglib/0038950,
  author = {Meier, Arne and Vollmer, Heribert},
  date-added = {2023-06-27 11:37:52 +0200},
  date-modified = {2023-06-27 11:37:52 +0200},
  publisher = {Lehmanns Media},
  series = {Mathematik f{\"{u}}r Anwendungen},
  title = {Komplexit{\"{a}}t von Algorithmen},
  volume = {4},
  year = {2015}
}

@misc{Meier:2011tp,
  author = {Meier, Arne},
  month = nov,
  howpublished = {PhD Thesis, Leibniz Universität Hannover, Institut für Theoretische Informatik},
  title = {{On the Complexity of Modal Logic Variants and their Fragments}},
  keywords = {temporal logic, CTL, CTL*, satisfiability, model checking, description logic, ALC, Post's lattice, complexity theory},
  year = {2011}
}

@misc{Mei07,
  howpublished = {Master's Thesis, Leibniz Universit\"at Hannover, Institut f\"ur Theoretische Informatik},
  author = {Meier, Arne},
  title = {{Complexity of Temporal Logics}},
  keywords = {CTL, CTL*, temporal logic, satisfiability, complexity theory, Post's lattice},
  year = {2007}
}

@misc{Mei05,
  annote = {Bachelor's Thesis},
  author = {Meier, Arne},
  date-modified = {2022-11-17 21:23:58 +0200},
  howpublished = {Bachelor Thesis, Leibniz Universit\"at Hannover, Institut f\"ur Theoretische Informatik},
  title = {{SAT-Algorithmen}},
  year = {2005}
}