W3C home > Mailing lists > Public > public-rdf-wg@w3.org > September 2012

Re: Draft for a "minimal dataset semantics"

From: Ivan Herman <ivan@w3.org>
Date: Fri, 14 Sep 2012 09:40:02 +0200
Cc: Antoine Zimmermann <antoine.zimmermann@emse.fr>, RDF WG <public-rdf-wg@w3.org>
Message-Id: <1F9AB22E-8FD7-47C6-BC1B-540C56F9948A@w3.org>
To: Peter F. Patel-Schneider <pfpschneider@gmail.com>

On Sep 13, 2012, at 20:13 , Peter F. Patel-Schneider wrote:
> peter
> PS:  Here is a reiteration of the old proposals.
> There is no independent notion of interpretations of RDF datasets.    If you want to do something like entailment between RDF datasets you can either look at one component of the dataset, so you ask whether the default graphs sit in an entailment relationship or ask whether the graphs with a particular name sit in an entailment relationship, or you can look at the entire dataset, so you ask whether the default graphs sit in an entailment relationship and all the similarly-named graphs sit in an entailment relationship.  In each case you probably want to consider a missing named graph to be the empty graph.  This ends up being more flexible and considerably simpler than the minimal semantics currently being proposed, as well as requiring no new reasoning machinery.

Isn't that the same as the question in


(together with an additional term as in DD2)

That was certainly an alternative that was discussed and the main reason why that road was not adopted was that the design would be more complex. I do not think there was any fundamental objection against this except for this complexity issue (which, to be clear, is an important argument!)


Ivan Herman, W3C Semantic Web Activity Lead
Home: http://www.w3.org/People/Ivan/
mobile: +31-641044153
FOAF: http://www.ivan-herman.net/foaf.rdf
Received on Friday, 14 September 2012 07:40:25 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 22:02:07 UTC