A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom
Aiming to understand the data complexity of answering conjunctive queries mediated by an axiom stating that a class is covered by the union of two other classes, we show that deciding their first-order rewritability is PSPACE-hard and obtain a number of sufficient conditions for membership in AC0, L...
| Main Authors: | , , , , |
|---|---|
| Format: | Monograph |
| Language: | English |
| Published: |
International Joint Conferences on Artificial Intelligence Organization
2020
|
| Subjects: | |
| Online Access: | https://repository.londonmet.ac.uk/6021/1/2006.04167.pdf |