Search

• < Previous
• 1
• Next >

---

The Data Complexity of Description Logic Ontologies

Carsten Lutz ; Frank Wolter.

We analyze the data complexity of ontology-mediated querying where the ontologies are formulated in a description logic (DL) of the ALC family and queries are conjunctive queries, positive existential queries, or acyclic conjunctive queries. Our approach is non-uniform in the sense that we aim to&nbsp;[&hellip;]

---

The Data Complexity of Ontology-Mediated Queries with Closed Predicates

Carsten Lutz ; Inanc Seylan ; Frank Wolter.

In the context of ontology-mediated querying with description logics (DLs), we study the data complexity of queries in which selected predicates can be closed (OMQCs). We provide a non-uniform analysis, aiming at a classification of the complexity into tractable and non-tractable for ontologies in&nbsp;[&hellip;]

---