| Publication | Date of Publication | Type |
|---|
The adjacent fragment and Quine's limits of decision
Journal of Logic and Computation | 2025-09-30 | Paper |
About the expressive power and complexity of order-invariance with two variables
Logical Methods in Computer Science | 2025-05-06 | Paper |
| Why propositional quantification makes modal logics on trees robustly hard? | 2024-12-19 | Paper |
| On the limits of decision: the adjacent fragment of first-order logic | 2024-11-14 | Paper |
| Towards a model theory of ordered logics: expressivity and interpolation | 2024-08-06 | Paper |
Exploring non-regular extensions of propositional dynamic logic with description-logics features
Logical Methods in Computer Science | 2024-06-27 | Paper |
| Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features | 2024-05-29 | Paper |
scientific article; zbMATH DE number 7799614 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\)
The Journal of Artificial Intelligence Research (JAIR) | 2023-12-20 | Paper |
Completing the Picture: Complexity of Graded Modal Logics with Converse
Theory and Practice of Logic Programming | 2023-12-12 | Paper |
| A Note on C² Interpreted over Finite Data-Words | 2023-11-02 | Paper |
Presburger Büchi tree automata with applications to logics with expressive counting
Logic, Language, Information, and Computation | 2023-06-02 | Paper |
On Composing Finite Forests with Modal Logics
ACM Transactions on Computational Logic | 2023-04-05 | Paper |
scientific article; zbMATH DE number 7577569 (Why is no real title available?)
(available as arXiv preprint) | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7577569 (Why is no real title available?) | 2022-08-30 | Paper |
| Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment | 2021-12-01 | Paper |
``Most of'' leads to undecidability: failure of adding frequencies to LTL
(available as arXiv preprint) | 2021-10-18 | Paper |
Satisfiability and query answering in description logics with global and local cardinality constraints
(available as arXiv preprint) | 2021-07-06 | Paper |
Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete
Information Processing Letters | 2021-06-16 | Paper |
Modal logics with composition on finite forests: expressivity and complexity
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Modulo counting on words and trees
(available as arXiv preprint) | 2020-11-25 | Paper |
Extending two-variable logic on trees
(available as arXiv preprint) | 2020-05-26 | Paper |
On the complexity of graded modal logics with converse
(available as arXiv preprint) | 2020-02-18 | Paper |
One-variable logic meets Presburger arithmetic
Theoretical Computer Science | 2019-11-22 | Paper |
