ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2205.02190
15
0
v1v2 (latest)

Ontology-Mediated Querying on Databases of Bounded Cliquewidth

4 May 2022
C. Lutz
Leif Sabellek
Lukas Schulze
ArXiv (abs)PDFHTML
Abstract

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\mathcal{ALC}ALC and ALCI\mathcal{ALCI}ALCI as well as the guarded two-variable fragment GF2_22​ 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.

View on arXiv
Comments on this paper