research
∙
03/08/2023
Definitions and (Uniform) Interpolants in First-Order Modal Logic
We first consider two decidable fragments of quantified modal logic 𝖲5: ...
share
research
∙
07/13/2022
Deciding FO-rewritability of regular languages and ontology-mediated queries in Linear Temporal Logic
Our concern is the problem of determining the data complexity of answeri...
research
∙
08/01/2021
Deciding boundedness of monadic sirups
We show that deciding boundedness (aka FO-rewritability) of monadic sing...
research
∙
05/13/2021
Deciding FO-definability of Regular Languages
We prove that, similarly to known PSpace-completeness of recognising FO(...
research
∙
06/07/2020
A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom
Aiming to understand the data complexity of answering conjunctive querie...
research
∙
05/23/2019
