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

11/06/2019
by   Julien Corman, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2020

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

Counting answers to a query is an operation supported by virtually all d...
research
08/25/2020

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 ...
research
06/13/2016

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

The inherent inflexibility and incompleteness of commonsense knowledge b...
research
07/02/2018

Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm

The lifted dynamic junction tree algorithm (LDJT) efficiently answers fi...
research
01/21/2023

Diversity of Answers to Conjunctive Queries

Enumeration problems aim at outputting, without repetition, the set of s...
research
07/22/2022

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

Controlled Query Evaluation (CQE) has been recently studied in the conte...
research
12/21/2022

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