A SPARQL Semantics Based on Datalog

Authors:
Simon Schenk
Affiliations:
Institute for Computer Science, University of Koblenz,
Venue:
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Year:
2007

Citing 4
Cited 7

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Named graphs, provenance and trust

WWW '05 Proceedings of the 14th international conference on World Wide Web
Semantics and complexity of SPARQL

ISWC'06 Proceedings of the 5th international conference on The Semantic Web

Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web

Proceedings of the 17th international conference on World Wide Web
The Expressive Power of SPARQL

ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Modeling and querying graphical representations of statistical data

Web Semantics: Science, Services and Agents on the World Wide Web
Technically approaching the semantic web bottleneck

International Journal of Web Engineering and Technology
Modelling probabilistic inference networks and classification in probabilistic datalog

SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
vSPARQL: A view definition language for the semantic web

Journal of Biomedical Informatics
Linked provenance data: A semantic Web-based approach to interoperable workflow traces

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

SPARQL is the upcoming W3C standard query language for RDF data in the semantic web. In this paper we propose a formal semantics for SPARQL based on datalog. A mapping of SPARQL to datalog allows to easily reuse existing results from logics for analysis and extensions of SPARQL. Using this semantics we analyse the complexity of query answering in SPAQRL and propose two useful extensions to SPARQL, namely binding of variables to results of filter expressions and views on RDF graphs as datasets for queries. We show that these extensions to not add to the overall complexity of SPARQL.