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

Book chapter

On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom

P. 1-12.

Thispaperreportsonourongoingworkthataimsataclassificationof conjunctive queries q according to the data complexity of answering ontology- mediated queries ({A ⊑ T ⊔ F }, q). We give examples of queries from the complexity classes C ∈ {AC0, L, NL, P, CONP}, and obtain a few syntactical conditions for C-membership and C-hardness. 

In book

Edited by: A. Artale, B. Glimm, R. Kontchakov. Aachen: CEUR Workshop Proceedings, 2017.