Search

• < Previous
• 1
• Next >

---

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;]

---

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

Cristina Feier ; Antti Kuusisto ; Carsten Lutz.

We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and on conjunctive queries. We show that rewritability into FO and into monadic Datalog (MDLog) are&nbsp;[&hellip;]

---