English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study the evaluation of ontology-mediated queries (OMQs) on databases ofbounded cliquewidth from the viewpoint of parameterized complexity theory. Asthe ontology language, we consider the description logics $\mathcal{ALC}$ and$\mathcal{ALCI}$ as well as the guarded two-variable fragment GF$_2$ offirst-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 maincontribution is a detailed analysis of the dependence of the running time onthe parameter, exhibiting several interesting effects.

Ontology-Mediated Querying on Databases of Bounded Cliquewidth