SPAR$^2$QL: From SPARQL to Rules. Polleres, A. & Schindlauer, R. In International Semantic Web Conference (ISWC2006 – Posters Track), Athens, GA, USA, November, 2006. Abstract, the full poster is available at r̆l
SPAR$^2$QL: From SPARQL to Rules [pdf]Paper  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, has just reached candidate 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 tackled, where especially languages with their roots in Logic Programming and Deductive Databases are receiving considerable attention. In this work we try to bridge the gap between these two efforts by providing translations between SPARQL and Datalog extended with negation and external built-in predicates. It appears that such a combination serves both as an underpinning for a more general rules and query language on top of RDF and SPARQL as well as for direct implementations of SPARQL on top of existing rules engines. Our prototype implementation is based on the datalog engine DLV. As it turns out, features of the language of this system can be fruitfully combined with SPARQL.

Downloads: 0