Re: Current agreement upon named graphs

Sorry all i might be missing a lot of subtleties

are we saying that in the current specs and implementation one can
alter the content of graph B by messing with some triples on a graph A
(one with a blank node?) ????

Pat i dont get the 'case where subsets of a single large graph are
being isolated and processed'  ? could you make an example?

thanks
Gio

On Mon, Nov 12, 2012 at 10:18 AM, Pat Hayes <phayes@ihmc.us> wrote:
> formally allow two distinct graphs to be able to share bnodes, because of the case where subsets of a single large graph are being isolated and processed. We also wanted to ensure tha

Received on Monday, 12 November 2012 10:11:33 UTC