We study the evaluation of ontology-mediated queries (OMQs) on databases of bounded cliquewidth from the viewpoint of parameterized complexity theory. As the ontology language, we consider the description logics ALC and ALCI as well as the guarded two-variable fragment GF2 of first-order logic. Queries are atomic queries (AQs), conjunctive queries (CQs), and unions of CQs. All studied OMQ problems are fixed-parameter linear (FPL) when the parameter is the size of the OMQ plus the cliquewidth. Our main contribution is a detailed analysis of the dependence of the running time on the parameter, exhibiting several interesting effects.
@article{arxiv.2205.02190,
title = {Ontology-Mediated Querying on Databases of Bounded Cliquewidth},
author = {Carsten Lutz and Leif Sabellek and Lukas Schulze},
journal= {arXiv preprint arXiv:2205.02190},
year = {2022}
}