• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

More on the Data Complexity of Answering Ontology-Mediated Queries with a Covering Axiom

P. 143-158.

This paper reports on our ongoing work that aims at a classification of conjunctive queries q according to the data complexity of answering ontology-mediated queries (A -> T v F, q). We give examples of queries from the complexity classes C in {AC0, L, NL, P, coNP}, and obtain a few syntactical conditions for C-membership and C-hardness.

In book

Edited by: P. Różewski, C. Lange. Berlin: Springer, 2017.