Haifa, Israel. July 31–August 5, 2022.
ISSN: 2334-1033
ISBN: 978-1-956792-01-0
Copyright © 2022 International Joint Conferences on Artificial Intelligence Organization
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.