# Ontology-Mediated Querying on Databases of Bounded Cliquewidth

arXiv: https://arxiv.org/abs/2205.02190 · HTML: https://mlsanity.com/paper/2205.02190/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 5 of its 69 references that are in the map.
- First posted on arXiv 4 May 2022.

## Builds on (most cited first, 5 of 5)

- [Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP](https://mlsanity.com/paper/1301.6479/) (2013)
- [A Single-Exponential Time 2-Approximation Algorithm for Treewidth](https://mlsanity.com/paper/2104.07463/) (2021)
- [An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version)](https://mlsanity.com/paper/1901.06862/) (2019)
- [Unary negation](https://mlsanity.com/paper/1309.2069/) (2013)
- [How to Approximate Ontology-Mediated Queries](https://mlsanity.com/paper/2107.05369/) (2021)

## Abstract (arXiv)

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.