From SPARQL to Rules (and back). Polleres, A. In Proceedings of the 16th World Wide Web Conference (WWW2007), pages 787–796, Banff, Canada, May, 2007. ACM Press. Extended technical report version available at ˘rlhttp://www.polleres.net/TRs/GIA-TR-2006-11-28.pdf, slides available at ˘rlhttp://www.polleres.net/publications/poll-2007www-slides.pdf
From SPARQL to Rules (and back) [link]Paper  doi  abstract   bibtex   
As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two related aspects. On the one hand, the definition of a suitable query language for RDF, SPARQL, is close to recommendation status within the W3C. The establishment of the rules layer on top of the existing stack on the other hand marks the next step to be taken, where languages with their roots in Logic Programming and Deductive Databases are receiving considerable attention. The purpose of this paper is threefold. First, we discuss the formal semantics of SPARQL extending recent results in several ways. Second, we provide translations from SPARQL to Datalog with negation as failure. Third, we propose some useful and easy to implement extensions of SPARQL, based on this translation. As it turns out, the combination serves for direct implementations of SPARQL on top of existing rules engines as well as a basis for more general rules and query languages on top of RDF.
@inproceedings{poll-2007,
	Abstract = {As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two related aspects. On the one hand, the definition of a suitable query language for RDF, SPARQL, is close to recommendation status within the W3C. The establishment of the rules layer on top of the existing stack on the other hand marks the next step to be taken, where languages with their roots in Logic Programming and Deductive Databases are receiving considerable attention. The purpose of this paper is threefold. First, we discuss the formal semantics of SPARQL extending recent results in several ways. Second, we provide translations from SPARQL to Datalog with negation as failure. Third, we propose some useful and easy to implement extensions of SPARQL, based on this translation. As it turns out, the combination serves for direct implementations of SPARQL on top of existing rules engines as well as a basis for more general rules and query languages on top of RDF.},
	Address = {Banff, Canada},
	Author = {Axel Polleres},
	Booktitle = {Proceedings of the 16th World Wide Web Conference (WWW2007)},
	Day = {8--12},
	Month = may,
	Note = {Extended technical report version available at \url{http://www.polleres.net/TRs/GIA-TR-2006-11-28.pdf}, slides available at \url{http://www.polleres.net/publications/poll-2007www-slides.pdf}},
	Pages = {787--796},
	Publisher = {ACM Press},
	Talk = {Axel Polleres},
	Title = {From {SPARQL} to Rules (and back)},
	Type = CONF,
	Url = {http://www2007.org/paper435.php},
	doi = {https://doi.org/10.1145/1242572.1242679},
	Year = 2007,
	Bdsk-Url-1 = {http://www2007.org/paper435.php}}

Downloads: 0