DeepAI AI Chat
Log In Sign Up

Answering Counting Queries over DL-Lite Ontologies

by   Meghyn Bienvenu, et al.

Ontology-mediated query answering (OMQA) is a promising approach to data access and integration that has been actively studied in the knowledge representation and database communities for more than a decade. The vast majority of work on OMQA focuses on conjunctive queries, whereas more expressive queries that feature counting or other forms of aggregation remain largely unex-plored. In this paper, we introduce a general form of counting query, relate it to previous proposals, and study the complexity of answering such queries in the presence of DL-Lite ontologies. As it follows from existing work that query answering is intractable and often of high complexity, we consider some practically relevant restrictions, for which we establish improved complexity bounds.


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

Counting answers to a query is an operation supported by virtually all d...

Computing Datalog Rewritings beyond Horn Ontologies

Rewriting-based approaches for answering queries over an OWL 2 DL ontolo...

Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies

A prominent problem in knowledge representation is how to answer queries...

Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Technical Report)

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

The Complexity of Why-Provenance for Datalog Queries

Explaining why a database query result is obtained is an essential task ...

A Practical Acyclicity Notion for Query Answering over Horn-SRIQ Ontologies

Conjunctive query answering over expressive Horn Description Logic ontol...

Consistent Query Answering for Primary Keys and Conjunctive Queries with Counting

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