Counting Query Answers over a DL-Lite Knowledge Base (extended version)

Calvanes, Diego; Corman, Julien; Lanti, Davide; Razniewski, Simon

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Paper

Counting Query Answers over a DL-Lite Knowledge Base (extended version)

MPS-Authors

/persons/resource/persons212613

Razniewski, Simon
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

2005.05886.pdf
(Preprint), 9KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Calvanes, D., Corman, J., Lanti, D., & Razniewski, S. (2020). Counting Query Answers over a DL-Lite Knowledge Base (extended version). Retrieved from https://arxiv.org/abs/2005.05886.

Cite as: https://hdl.handle.net/21.11116/0000-0007-FF5A-6

Abstract

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.