Recently, the study of the unique characterisability and learnability of...
In reverse engineering of database queries, we aim to construct a query ...
We first consider two decidable fragments of quantified modal logic
𝖲5: ...
Our concern is the problem of determining the data complexity of answeri...
We aim to determine which temporal instance queries can be uniquely
char...
Aiming at ontology-based data access to temporal data, we design
two-dim...
We show that deciding boundedness (aka FO-rewritability) of monadic sing...
We prove that, similarly to known PSpace-completeness of recognising
FO(...
Aiming to understand the data complexity of answering conjunctive querie...
We investigate ontology-based data access to temporal data. We consider
...
We investigate the data complexity of answering queries mediated by metr...
Horn description logics are syntactically defined fragments of standard
...
We investigate the problem whether two ALC ontologies are indistinguisha...
The question whether an ontology can safely be replaced by another, poss...
The recently introduced series of description logics under the common mo...
Our aim is to investigate ontology-based data access over temporal data ...
We design temporal description logics suitable for reasoning about tempo...