W3C home > Mailing lists > Public > public-rdf-dawg-comments@w3.org > November 2009

Inferencing on graph patterns

From: Simon Reinhardt <simon.reinhardt@koeln.de>
Date: Mon, 09 Nov 2009 13:06:41 +0100
Message-ID: <4AF805D1.7020907@koeln.de>
To: public-rdf-dawg-comments@w3.org

In trying to understand SPARQL 1.1 Entailment Regimes [1] I was wondering if inferencing will ever take place on the RDF data in graph patterns themselves. Consider the following data in a store:

(1) ex:C1 rdfs:subClassOf ex:C2 .
(2) :myC1 a ex:C1 .

Now when you do the following query at the endpoint for the store:

SELECT ?type WHERE { ?x a ex:C1 , ?type }

and it supports the RDFS entailment regime the result would be ex:C1 and ex:C2 because the store would infer :myC1 to be of type ex:C2, either when the data got added or on-the-fly.

But what if the store didn't contain triple (2) and so no data about any instances of those two classes? Is there any way that it could make inferences about the data in the WHERE clause and therefore infer that ?x would be of type ex:C2 as well? I guess not since this is querying by matching patterns rather than "query by example". But I can see various uses for this. So if this is not how it's currently defined to work, have you considered this?


[1] http://www.w3.org/TR/2009/WD-sparql11-entailment-20091022/
Received on Monday, 9 November 2009 12:07:20 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:52:10 UTC