| Publication | Date of Publication | Type |
|---|
| Parameterised counting in logspace | 2026-04-21 | Paper |
Logics with probabilistic team semantics and the Boolean negation
Journal of Logic and Computation | 2025-10-29 | Paper |
| Temporal team semantics revisited | 2024-12-06 | Paper |
Parameterized complexity of weighted team definability
Mathematical Structures in Computer Science | 2024-10-16 | Paper |
Strong backdoors for default logic
ACM Transactions on Computational Logic | 2024-09-25 | Paper |
Strong backdoors for default logic
ACM Transactions on Computational Logic | 2024-07-10 | Paper |
| Logics with probabilistic team semantics and the Boolean negation | 2024-05-29 | Paper |
Parameterised counting in logspace
Algorithmica | 2023-10-06 | Paper |
Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework
ACM Transactions on Computational Logic | 2023-07-18 | Paper |
| Submodel enumeration of Kripke structures in modal logic | 2023-03-24 | Paper |
A parameterized view on the complexity of dependence and independence logic
Journal Of Logic And Computation | 2023-01-04 | Paper |
| A parameterized view on the complexity of dependence logic | 2022-07-01 | Paper |
A parameterized view on the complexity of dependence logic
(available as arXiv preprint) | 2022-07-01 | Paper |
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Annals of Mathematics and Artificial Intelligence | 2022-02-14 | Paper |
Parameterized complexity of abduction in Schaefer's framework
Journal Of Logic And Computation | 2022-02-08 | Paper |
Team semantics for the specification and verification of hyperproperties
(available as arXiv preprint) | 2021-08-04 | Paper |
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Lecture Notes in Computer Science | 2020-10-26 | Paper |
Model checking and validity in propositional and modal inclusion logics
(available as arXiv preprint) | 2020-05-26 | Paper |
Parameterised complexity of abduction in Schaefer's framework
(available as arXiv preprint) | 2020-05-06 | Paper |
Model checking and validity in propositional and modal inclusion logics
Journal Of Logic And Computation | 2020-02-03 | Paper |
Satisfiability of modal inclusion logic. Lax and strict semantics
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
The model checking fingerprints of CTL operators
Acta Informatica | 2019-08-13 | Paper |
Backdoors for linear temporal logic
Algorithmica | 2019-02-14 | Paper |
Approximation and dependence via multiteam semantics
Annals of Mathematics and Artificial Intelligence | 2018-09-21 | Paper |
| Complexity of model checking for logics over Kripke models | 2018-09-04 | Paper |
Probabilistic team semantics
(available as arXiv preprint) | 2018-06-26 | Paper |
Enumeration complexity of poor man's propositional dependence logic
(available as arXiv preprint) | 2018-06-26 | Paper |
Backdoors for linear temporal logic
(available as arXiv preprint) | 2018-04-10 | Paper |
Paradigms for parameterized enumeration
Theory of Computing Systems | 2017-08-15 | Paper |
Parametrised complexity of satisfiability in temporal logic
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Strong Backdoors for Default Logic
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
Approximation and dependence via multiteam semantics
Lecture Notes in Computer Science | 2016-05-19 | Paper |
Approximation and dependence via multiteam semantics
Lecture Notes in Computer Science | 2016-05-19 | Paper |
Erratum to: ``The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\)''
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
Parameterized enumeration for modification problems
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Parameterized complexity of CTL
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Modal inclusion logic: being lax is simpler than being strict
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Generalized satisfiability for the description logic \(\mathcal{ALC}\)
Theoretical Computer Science | 2014-01-16 | Paper |
Paradigms for parameterized enumeration
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Extended modal dependence logic \(\mathcal{EMDL}\)
Logic, Language, Information, and Computation | 2013-09-17 | Paper |
The complexity of reasoning for fragments of default logic
Journal of Logic and Computation | 2012-06-20 | Paper |
On the parameterized complexity of default logic and autoepistemic logic
Language and Automata Theory and Applications | 2012-06-08 | Paper |
Generalized satisfiability for the description logic \(\mathcal{ALC}\) (extended abstract)
Lecture Notes in Computer Science | 2011-07-01 | Paper |
