Ensuring Soundness for SPARQL with Negation Using Completeness Statements
Aus International Center for Computational Logic
Ensuring Soundness for SPARQL with Negation Using Completeness Statements
Vortrag von Fariz Darari
- Veranstaltungsort: APB 3027
- Beginn: 27. April 2016 um 14:50
- Ende: 27. April 2016 um 15:50
- Forschungsgruppe: Computational Logic
- Forschungsgruppe: Wissensbasierte Systeme
- Event series: KBS Seminar
- iCal
As RDF generally follows the Open-World Assumption, the use of negation in SPARQL queries might lead to unsound answers. Completeness statements have been proposed as metadata specifying that certain kinds of information are entirely recorded in an RDF data set. In this work, we leverage completeness statements to check whether we can guarantee soundness of query answering even when negation is used in SPARQL. We distinguish between the soundness of a specific answer of a graph pattern and the soundness of a graph pattern as a whole. We provide a formalization and characterize the problem of soundness checking via reduction to completeness checking. We also conduct an experimental evaluation to demonstrate the feasibility of our framework.
