On Fri, Oct 7, 2011 at 3:19 PM, Sandro Hawke <sandro@w3.org> wrote:
>
> Can you think of a way to frame this better? Mine was:
>
> For the graph naming to hold, every successful dereference of N
> yielding an RDF graph must yield G.
>
>
I would say something like:
For the graph naming to hold, G must be a graph parsed from one of the
temporally-varying set of representations identified by N
"Parsed" might be the wrong word
Ian
--
Ian Davis, Chief Technology Officer, Talis Group Ltd.
http://www.talis.com/ | Registered in England and Wales as 5382297