- From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
- Date: Thu, 26 Apr 2012 03:26:09 -0400
- To: Sandro Hawke <sandro@w3.org>
- CC: public-rdf-wg <public-rdf-wg@w3.org>
On 04/25/2012 11:03 AM, Sandro Hawke wrote:
> On Wed, 2012-04-25 at 10:38 -0400, Peter F. Patel-Schneider wrote:
>> This is all predicated on named graphs participating in entailment, which I
>> don't really agree with.
> I don't understand how you're looking at this. Do you have an
> alternative solution in mind, and does it address many/most of the use
> cases?
Yes, the alternative solution is that RDF datasets are data structures, and
that entailment is between RDF graphs only. This does put more into
application code, but I prefer that in this case.
[...]
>
> 3. Named graphs are opaque
>
> "<u> {<a> <b> <c>}" does not entail "<u> {<a> <b> _:x}"
>> Absolutely NOT!
> I can't tell if you're disagreeing with the entailment or the test case.
>
> I think the entailment.
>
> -- Sandro
Named graphs should not be opaque.
Received on Thursday, 26 April 2012 07:26:43 UTC