Re: [GRAPH] graph deadlock?

On 12/19/2011 09:51 AM, Peter Frederick Patel-Schneider wrote:
>
>> +1
>> What I'm reading here is that named graphs are a special kind of label
>> that explicitly provides for provenance and resolution.
> I would be interested in seeing just where and how named graphs
> explicity provide for provenance and resolution.
>
> [...]
You're right, I made the dangerous leap from named graphs to the idea of 
'where you can get a graph representation'

(2) Named Graphs. It is a special RDF dataset, where the label 'l' is a (HTTP?) URI with an additional behaviour: if that URI is poked (GET-d) then it results in the serialization of a Graph whose parsing yields an equivalent graph to 'G'. It is the right/good framework for, say, Linked Data, etc.


It's always seemed to me that if someone owns the web address from which 
you can get a graph, that's a kind of provenance assertion.  Now I'm not 
sure about the relationship between HTTP and provenance, if there is any.

Charles


>
>> Charles
>
> peter


-- 
Charles Greer
Senior Engineer
MarkLogic Corporation
charles.greer@marklogic.com
Phone: +1 707 408 3277
www.marklogic.com

This e-mail and any accompanying attachments are confidential. The information is intended solely for the use of the individual to whom it is addressed. Any review, disclosure, copying, distribution, or use of this e-mail communication by others is strictly prohibited. If you are not the intended recipient, please notify us immediately by returning this message to the sender and delete all copies. Thank you for your cooperation.

Received on Monday, 19 December 2011 20:12:32 UTC