W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > January to March 2006

Re: Wording change (was : Re: Final text for Basic Graph Patterns)

From: Enrico Franconi <franconi@inf.unibz.it>
Date: Thu, 19 Jan 2006 23:32:48 +0100
Message-Id: <E30E7FD2-109A-408B-B8D5-0BBCD953A127@inf.unibz.it>
Cc: RDF Data Access Working Group <public-rdf-dawg@w3.org>
To: Pat Hayes <phayes@ihmc.us>

On 19 Jan 2006, at 21:53, Pat Hayes wrote:
>> I want to leave clear the idea that simple entailment is  
>> essentially about reading the structure of a graph with anonymous  
>> labels (the bnodes), as opposed to entailments that consider the  
>> semantics of RDF or RDFS or OWL).
>
> Im happy to have some prose pointing out that simple entailment is  
> nothing more than structural matching to a subgraph, allowing for  
> instances to bnodes; and emphasizing that nothing that is not  
> already in the actual graph needs to be inferred or constructed,  
> even implicitly. This is pretty much a restating of the  
> interpolation lemma (http://www.w3.org/TR/rdf-mt/#interplemmaprf)  
> in the RDF semantics document.

This is what more or less is already in my text in the  
"implementational hint" part - but your formulation sounds partly  
better.
However, note that your current text does *not* provide for this  
obviously expected equivalence.
Hence, my insistence in keeping my formal definitions.

--e.
Received on Thursday, 19 January 2006 22:33:01 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:25 GMT