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

---

Spatial logics with connectedness predicates

Roman Kontchakov ; Ian Pratt-Hartmann ; Frank Wolter ; Michael Zakharyaschev.

We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological connectedness of regions and restrict the number of their connected components. We investigate the computational complexity of&nbsp;[&hellip;]

---