Current agreement upon named graphs

I have been out of the semantic web for some time, and I would like to know
the current agreement upon named graphs.

Here are my questions:
 - can a triple belong to several named graphs?
 - can the argument of the SPARQL "GRAPH" keyword  be *a list* of named graph?
if yes, is this list considered to be the union of all those named graphs?
 - is there a plan to investigate algebra of named graphs, such as :
(namedGraph1 && !namedGraph2) || namedGraph3?

Any comment is welcome.

Cheers,

Olivier.

Received on Friday, 9 November 2012 12:39:32 UTC