A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom

06/07/2020 ∙ by Olga Gerasimova, et al. ∙ 0

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, NL, and P. Our main result is a complete syntactic AC0//NL/P/coNP tetrachotomy of path queries under the assumption that the covering classes are disjoint.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.