| Temporal Team Semantics Revisited | 0 | 0.34 | 2022 |
| A Parameterized View on the Complexity of Dependence Logic. | 0 | 0.34 | 2022 |
| Enumerating teams in first-order team logics | 0 | 0.34 | 2022 |
| Parameterized Complexity Of Abduction In Schaefer'S Framework | 0 | 0.34 | 2021 |
| Knowledge-Base Degrees Of Inconsistency: Complexity And Counting | 0 | 0.34 | 2021 |
| Parameterized Complexity Of Logic-Based Argumentation In Schaefer'S Framework | 0 | 0.34 | 2021 |
| Parameterised Counting In Logspace | 0 | 0.34 | 2021 |
| Decomposition-Guided Reductions for Argumentation and Treewidth. | 0 | 0.34 | 2021 |
| Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics | 0 | 0.34 | 2020 |
| Parameterised Counting Classes with Bounded Nondeterminism | 0 | 0.34 | 2019 |
| Backdoors for Linear Temporal Logic. | 0 | 0.34 | 2019 |
| Parameterised Complexity for Abduction. | 0 | 0.34 | 2019 |
| Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. | 0 | 0.34 | 2019 |
| Team Semantics for the Specification and Verification of Hyperproperties. | 2 | 0.37 | 2018 |
| Counting Complexity for Reasoning in Abstract Argumentation | 0 | 0.34 | 2018 |
| Probabilistic team semantics. | 0 | 0.34 | 2018 |
| Enumeration Complexity of Poor Man's Propositional Dependence Logic. | 0 | 0.34 | 2018 |
| Enumeration in Incremental FPT-Time. | 0 | 0.34 | 2018 |
| Model Checking and Validity in Propositional and Modal Inclusion Logics. | 5 | 0.43 | 2017 |
| Parametrised Complexity of Satisfiability in Temporal Logic. | 2 | 0.39 | 2017 |
| Strong Backdoors for Default Logic. | 1 | 0.37 | 2016 |
| Strong Backdoors for Linear Temporal Logic. | 0 | 0.34 | 2016 |
| Parallel Computational Tree Logic. | 0 | 0.34 | 2015 |
| On the parameterized complexity of non-monotonic logics | 2 | 0.38 | 2015 |
| Approximation and Dependence via Multiteam Semantics | 2 | 0.40 | 2015 |
| Parameterized Enumeration for Modification Problems. | 3 | 0.40 | 2015 |
| Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. | 1 | 0.35 | 2015 |
| A Team Based Variant of CTL | 4 | 0.40 | 2015 |
| Modal Inclusion Logic: Being Lax is Simpler than Being Strict. | 9 | 0.66 | 2015 |
| Extended Modal Dependence Logic. | 1 | 0.37 | 2013 |
| Paradigms for Parameterized Enumeration. | 7 | 0.51 | 2013 |
| Generalized satisfiability for the description logic ALC | 2 | 0.37 | 2013 |
| Parameterized Enumeration with Ordering. | 0 | 0.34 | 2013 |
| Complexity of Model Checking for Logics over Kripke models. | 3 | 0.41 | 2012 |
| The complexity of reasoning for fragments of default logic1 | 17 | 0.75 | 2012 |
| The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers | 0 | 0.34 | 2012 |
| The Complexity of Reasoning for Fragments of Autoepistemic Logic. | 8 | 0.53 | 2012 |
| Generalized Complexity of ALC Subsumption | 0 | 0.34 | 2012 |
| On the parameterized complexity of default logic and autoepistemic logic | 1 | 0.35 | 2012 |
| Model Checking CTL is Almost Always Inherently Sequential | 7 | 0.55 | 2011 |
| Model Checking CTL is Almost Always Inherently Sequential | 2 | 0.37 | 2011 |
| Generalized Satisfiability for the Description Logic ALC\mathcal{ALC} - (Extended Abstract). | 0 | 0.34 | 2011 |
| Proof Complexity of Propositional Default Logic | 5 | 0.43 | 2010 |
| The Complexity of Satisfiability for Sub-Boolean Fragments of ALC | 2 | 0.37 | 2010 |
| The complexity of propositional implication | 18 | 0.74 | 2009 |
| The Complexity of Satisfiability for Fragments of CTL and CTL*; | 14 | 0.74 | 2009 |
| The Complexity of Satisfiability for Fragments of Hybrid Logic--Part I | 8 | 0.58 | 2009 |
