Counting Query Answers over a DL-Lite Knowledge Base (Extended Version)

Diego Calvanese, Julien Corman, Davide Lanti, and Simon Razniewski

Technical Report, arXiv.org e-Print archive. CoRR Technical Report arXiv:2005.05886 2020. Available at http://arxiv.org/abs/2005.05886.

Counting answers to a query is an operation supported by virtually all database management systems. In this paper we focus on counting answers over a Knowledge Base (KB), which may be viewed as a database enriched with background knowledge about the domain under consideration. In particular, we place our work in the context of Ontology-Mediated Query Answering/Ontology-based Data Access (OMQA/OBDA), where the language used for the ontology is a member of the DL-Lite family and the data is a (usually virtual) set of assertions. We study the data complexity of query answering, for different members of the DL-Lite family that include number restrictions, and for variants of conjunctive queries with counting that differ with respect to their shape (connected, branching, rooted). We improve upon existing results by providing a PTime and coNP lower bounds, and upper bounds in PTime and LogSpace. For the latter case, we define a novel query rewriting technique into first-order logic with counting.


@techreport{Corr-2020-counting,
   title = "Counting Query Answers over a DL-Lite Knowledge Base (Extended
Version)",
   year = "2020",
   author = "Diego Calvanese and Julien Corman and Davide Lanti and Simon
Razniewski",
   institution = "arXiv.org e-Print archive",
   number = "arXiv:2005.05886",
   note = "Available at http://arxiv.org/abs/2005.05886",
}
pdf url