[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Databases

arXiv:2205.02190 (cs)
[Submitted on 4 May 2022 (v1), last revised 13 Sep 2022 (this version, v2)]

Title:Ontology-Mediated Querying on Databases of Bounded Cliquewidth

Authors:Carsten Lutz, Leif Sabellek, Lukas Schulze
View PDF
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 $\mathcal{ALC}$ and $\mathcal{ALCI}$ as well as the guarded two-variable fragment GF$_2$ 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.
Subjects: Databases (cs.DB); Artificial Intelligence (cs.AI)
Cite as: arXiv:2205.02190 [cs.DB]
  (or arXiv:2205.02190v2 [cs.DB] for this version)
  https://doi.org/10.48550/arXiv.2205.02190
Related DOI: https://doi.org/10.24963/kr.2022/25

Submission history

From: Lukas Schulze [view email]
[v1] Wed, 4 May 2022 17:13:08 UTC (72 KB)
[v2] Tue, 13 Sep 2022 20:01:43 UTC (72 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.DB
< prev   |   next >
new | recent | 2022-05
Change to browse by:
cs
cs.AI

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)