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

by   Julien Corman, et al.

Ontology-Mediated Query Answering (OMQA) is a well-established framework to answer queries over an RDFS or OWL Knowledge Base (KB). OMQA was originally designed for unions of conjunctive queries (UCQs), and based on certain answers. More recently, OMQA has been extended to SPARQL queries, but to our knowledge, none of the efforts made in this direction (either in the literature, or the so-called SPARQL entailment regimes) is able to capture both certain answers for UCQs and the standard interpretation of SPARQL over a plain graph. We formalize these as requirements to be met by any semantics aiming at conciliating certain answers and SPARQL answers, and define three additional requirements, which generalize to KBs some basic properties of SPARQL answers. Then we show that a semantics can be defined that satisfies all requirements for SPARQL queries with SELECT, UNION, and OPTIONAL, and for DLs with the canonical model property. We also investigate combined complexity for query answering under such a semantics over DL-Lite R KBs. In particular, we show for different fragments of SPARQL that known upper-bounds for query answering over a plain graph are matched.


page 1

page 2

page 3

page 4


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

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

On the complexity of query containment and computing certain answers in the presence of ACs

We often add arithmetic to extend the expressiveness of query languages ...

Using a Distributional Semantic Vector Space with a Knowledge Base for Reasoning in Uncertain Conditions

The inherent inflexibility and incompleteness of commonsense knowledge b...

Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm

The lifted dynamic junction tree algorithm (LDJT) efficiently answers fi...

Diversity of Answers to Conjunctive Queries

Enumeration problems aim at outputting, without repetition, the set of s...

CQE in OWL 2 QL: A "Longest Honeymoon" Approach (extended version)

Controlled Query Evaluation (CQE) has been recently studied in the conte...

Tighter bounds for query answering with Guarded TGDs

We consider the complexity of the open-world query answering problem, wh...

Please sign up or login with your details

Forgot password? Click here to reset