SPARQL Beyond Subgraph Matching

From International Center for Computational Logic

Toggle side column

SPARQL Beyond Subgraph Matching

Birte GlimmBirte Glimm,  Markus KrötzschMarkus Krötzsch
Birte Glimm, Markus Krötzsch
SPARQL Beyond Subgraph Matching
In Peter F. Patel-Schneider, Yue Pan, Birte Glimm, Pascal Hitzler, Peter Mika, Jeff Pan, Ian Horrocks, eds., Proceedings of the 9th International Semantic Web Conference (ISWC 2010), volume 6496 of LNCS, 241-256, 2010. Springer
  • KurzfassungAbstract
    We extend the Semantic Web query language SPARQL by defining the semantics of SPARQL queries under the entailment regimes of RDF, RDFS, and OWL. The proposed extensions are part of the SPARQL 1.1 Entailment Regimes working draft which is currently being developed as part of the W3C standardization process of SPARQL 1.1. We review the conditions that SPARQL imposes on such extensions, discuss the practical difficulties of this task, and explicate the design choices underlying our proposals. In addition, we include an overview of current implementations and their underlying techniques.
  • Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-17746-0_16.
@inproceedings{GK2010,
  author    = {Birte Glimm and Markus Kr{\"{o}}tzsch},
  title     = {SPARQL Beyond Subgraph Matching},
  editor    = {Peter F. Patel-Schneider and Yue Pan and Birte Glimm and Pascal
               Hitzler and Peter Mika and Jeff Pan and Ian Horrocks},
  booktitle = {Proceedings of the 9th International Semantic Web Conference
               (ISWC 2010)},
  series    = {LNCS},
  volume    = {6496},
  publisher = {Springer},
  year      = {2010},
  pages     = {241-256},
  doi       = {10.1007/978-3-642-17746-0_16}
}