A SPARQL Semantics Based on Datalog

@incollection{citeulike:2799933, 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.}, author = {Schenk, Simon }, citeulike-article-id = {2799933}, doi = {10.1007/978-3-540-74565-5\_14}, journal = {KI 2007: Advances in Artificial Intelligence}, keywords = {query, semantics, sparql}, pages = {160--174}, posted-at = {2008-05-14 21:20:31}, priority = {2}, title = {A SPARQL Semantics Based on Datalog}, url = {http://dx.doi.org/10.1007/978-3-540-74565-5\_14}, year = {2007} }

TY - CHAP ID - citeulike:2799933 L3 - citeulike-article-id:2799933 TI - A SPARQL Semantics Based on Datalog JF - KI 2007: Advances in Artificial Intelligence SP - 160 EP - 174 N2 - 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. KW - query KW - semantics KW - sparql AU - Schenk, Simon PY - 2007/// UR - http://dx.doi.org/10.1007/978-3-540-74565-5_14 ER -