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

by   Diego Calvanese, et al.
Max Planck Society
Free University of Bozen-Bolzano

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.


page 1

page 2

page 3

page 4


Certain Answers to a SPARQL Query over a Knowledge Base (extended version)

Ontology-Mediated Query Answering (OMQA) is a well-established framework...

Answering Counting Queries over DL-Lite Ontologies

Ontology-mediated query answering (OMQA) is a promising approach to data...

Recursive algorithms to repair prioritized and inconsistent dl-lite knowledge base

The inconsistency in prioritized knowledge base is because the assertion...

Explaining Ontology-Mediated Query Answers using Proofs over Universal Models (Technical Report)

In ontology-mediated query answering, access to incomplete data sources ...

Polynomial Rewritings from Expressive Description Logics with Closed Predicates to Variants of Datalog

In many scenarios, complete and incomplete information coexist. For this...

Optimal Alignment of Temporal Knowledge Bases

Answering temporal CQs over temporalized Description Logic knowledge bas...

Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting

The problem of consistent query answering for primary keys and self-join...

Please sign up or login with your details

Forgot password? Click here to reset