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.
This research was supported by the European Commission under contract FP6-027026, Knowledge Space of semantic inference for automatic annotation and retrieval of multimedia content - K-Space. The expressed content is the view of the authors but not necessarily the view of the K-Space project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bechhofer, S., van Harmelen, F., Hendler, J., Horrocks, I., McGuinness, D.L., Patel-Schneider, P.F., Stein, L.A.: Owl web ontology language reference (2004), http://www.w3.org/TR/owl-ref/
Berners-Lee, T.: Notation 3 (2006), http://www.w3.org/DesignIssues/Notation3
Carroll, J.J., Bizer, C., Hayes, P., Stickler, P.: Named graphs, provenance and trust. In: WWW 2005, pp. 613–622. ACM Press, New York (2005)
Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing. Surveys 33(3), 374–425 (2001)
de Bruijn, J., Franconi, E., Tessaris, S.: Logical reconstruction of normative RDF. In: OWL: Experiences and Directions Workshop, Galway, Ireland, November 2005. CEUR Workshop Proceedings (2005), http://www.debruijn.net/publications/owl-05.pdf
Decker, S.: Semantic Web Methods for Knowledge Management. Phd thesis, University of Karlsruhe (February 2002)
Lloyd, J.W., Topor, R.W.: Making Prolog more expressive. Journal of Logic Programming 1(3), 225–240 (1984)
Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, Universität Karlsruhe (TH) (2006)
Hayes, P.: Rdf semantics, http://www.w3.org/TR/2004/REC-rdf-mt-20040210/
Pérez, J., Arenas, M., Gutierrez, C.: Semantics and Complexity of SPARQL. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 30–43. Springer, Heidelberg (2006)
Polleres, A.: From SPARQL to rules (and back). Technical report (December 2006), http://www.polleres.net/publications/GIA-TR-2006-11-28.pdf
Prud’hommeaux, E., Seaborne, A.: SPARQL Query Language for RDF (2007), http://www.w3.org/TR/rdf-sparql-query/
Schenk, S., Staab, S.: Networked RDF Graphs. Technical report (December 2006) http://uni-koblenz.de/~sschenk/publications/2006/ngtr.pdf
van Gelder, A., Ross, K., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38(3), 620–650 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schenk, S. (2007). A SPARQL Semantics Based on Datalog. In: Hertzberg, J., Beetz, M., Englert, R. (eds) KI 2007: Advances in Artificial Intelligence. KI 2007. Lecture Notes in Computer Science(), vol 4667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74565-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-74565-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74564-8
Online ISBN: 978-3-540-74565-5
eBook Packages: Computer ScienceComputer Science (R0)