- From: Sandro Hawke <sandro@w3.org>
- Date: Wed, 02 May 2012 10:06:02 -0400
- To: Pat Hayes <phayes@ihmc.us>
- Cc: Jeremy Carroll <jeremy@topquadrant.com>, public-rdf-wg@w3.org
On Wed, 2012-05-02 at 01:22 -0500, Pat Hayes wrote: > The SPARQL rec document has 39 occurrences of the phrase "named graph". The first 38 of them are ambiguous, and can be read either way (the named graph is a graph or a <name, graph> pair.) However, the last, in section 12.1.2, is quite clear: You really went through them all? Wow. Here's my proposed consensus text about the term Named Graphs: http://dvcs.w3.org/hg/rdf/raw-file/default/rdf-layers/index.html#named-graph -- Sandro > ------- > > Definition: RDF Dataset > An RDF dataset is a set: > { G, (<u1>, G1), (<u2>, G2), . . . (<un>, Gn) } > where G and each Gi are graphs, and each <ui> is an IRI. Each <ui> is distinct. > > G is called the default graph. (<ui>, Gi) are called named graphs. > > ------- > > Pat > > On Apr 27, 2012, at 12:45 PM, Jeremy Carroll wrote: > > > On 4/27/2012 1:44 AM, Antoine Zimmermann wrote: > >> Remember that "named graph" is normative as it's part of a normative section of the SPARQL recommendation. > > > > I just looked this up, and the definition seems to be in section 8 > > http://www.w3.org/TR/2008/REC-rdf-sparql-query-20080115/#rdfDataset > > "An RDF Dataset comprises one graph, the default graph, which does not have a name, and zero or more named graphs, where each named graph is identified by an IRI." > > > > This wording seems to me to suggest that G is a named graph if and only if there is a pair > > > > (u, G) > > > > in the dataset. > > > > JeremyThe SP > > > > > > ------------------------------------------------------------ > IHMC (850)434 8903 or (650)494 3973 > 40 South Alcaniz St. (850)202 4416 office > Pensacola (850)202 4440 fax > FL 32502 (850)291 0667 mobile > phayesAT-SIGNihmc.us http://www.ihmc.us/users/phayes > > > > > > >
Received on Wednesday, 2 May 2012 14:06:15 UTC