REWERSE-RP-2007-137

Axel Polleres, Roman Schindlauer:
DLVHEX-SPARQL: A SPARQL Compliant Query Engine Based on DLVHEX.


Complete Text [
.pdf, 177KB]
In: Proceedings of 2nd International Workshop on Applications of Logic Programming to the Web, Semantic Web and Semantic Web Services (ALPSWS2007), Porto, Portugal (13th September 2007) 287, 3-12, September 2007
© CEUR Workshop Proceedings

Abstract
This paper describes the DLVHEX SPARQL plugin, a query processor for the upcoming Semantic Web query language standard by W3C. We report on the implementation of this languages using dlvhex, a flexible plugin system on top of the DLV solver. This work advances our earlier translation based on the semantics by Perez et al. towards an engine which is fully compliant to the official SPARQL specification. As it turns out, the differences between these two definitions of SPARQL, which might seem moderate at first glance, need some extra machinery. We also briefly report the status of implementation, and extensions currently being implemented, such as handling of aggregates, nested CONSTRUCT queries in the spirit of networked RDF graphs, or partially support of RDFS entailment. For such extensions a tight integration of SPARQL query processing and Answer-Set Programming, the underlying logic programming formalism of our engine, turns out to be particularly useful, as the resulting programs can actually involve unstratified negation.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2007-137

BibTeX:

@inproceedings{REWERSE-RP-2007-137,
	author = {Axel Polleres and Roman Schindlauer},
	title = {DLVHEX-SPARQL: A SPARQL Compliant Query Engine Based on DLVHEX},
	booktitle = {Proceedings of 2nd International Workshop on Applications of Logic Programming to the Web, Semantic Web and Semantic Web Services, Porto, Portugal (13th September 2007)},
	year = {2007},
	volume = {287},
	pages = {3--12},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2007-137}
}

Imprint      Privacy Disclaimer