Presented at: 10th ESWC 2013 (ESWC2013)
We introduce a technique to determine implicit information in an RDF graph. In addition to taxonomic knowledge about concepts and properties typically expressible in languages such as RDFS and OWL, we focus on knowledge determined by arithmetic equations. The main use case is exploiting knowledge about functional dependencies among numerical properties expressible by means of such arithmetic equations. While some of this knowledge is expressible for instance in rule extensions to ontology languages, we provide a more flexible framework that treats property equations as first class citizens in the ontology language. The combination of ontological reasoning and property equations is realized by extending query rewriting techniques already successfully applied for ontology languages such as (the DL-fragment of) RDFS, or also OWL QL, respectively. We deploy this technique for rewriting SPARQL queries and discuss the feasibility of alternative implementations, such as rule-based approaches.
Keywords: SPARQL, equations, query rewriting
Resource URI on the dog food server: http://data.semanticweb.org/conference/eswc/2013/paper/eswc-2013/118
Explore this resource elsewhere: