W3C home > Mailing lists > Public > www-archive@w3.org > April 2004

Re: Named graphs next draft

From: Patrick Stickler <patrick.stickler@nokia.com>
Date: Tue, 13 Apr 2004 09:19:51 +0300
Message-Id: <929C2379-8D12-11D8-8853-000A95EAFCEA@nokia.com>
Cc: "Jeremy Carroll" <jjc@hplb.hpl.hp.com>, <www-archive@w3.org>, "Pat Hayes" <phayes@ihmc.us>
To: "ext Chris Bizer" <chris@bizer.de>


Sorry for disappearing over the long weekend (holidays, family, travel,
and all those sorts of distractions... ;-)


On Apr 08, 2004, at 16:38, ext Chris Bizer wrote:

>
> Hi,
>
>
> The Semantic Web consists of many RDF graphs named by URIs.

"named by" -> "nameable by"

I.e. the SW also includes alot of unnamed graphs...

> This
> paper extends the syntax and semantics of RDF to cover such
> collections of Named Graphs.

"to cover such collections of Named Graphs" -> "to cover such Named 
Graphs"

I think the term 'collections' may be too loaded. Better to state
it more generally.

> This enables RDF statements that
> describe graphs, which is beneficial in many Semantic Web
> application areas. As a case study, we explore the application
> area of Semantic Web publishing: Named Graphs allow publishers to
> communicate assertional intent, and to sign their graphs;
> information consumers can evaluate specific graphs using
> task-specific trust policies, and act on information from those
> named graphs that they accept. Graphs are trusted depending on:
> their content; information about the graph; and the task the user
> is performing. The extension of RDF to Named Graphs provides a
> formally defined framework which could be used as a foundation for
> the Semantic Web trust layer.

I like the rest.

>
> Is the last sentence to ambitious?

It doesn't seem so to me.

> We could also write:
>
> This provides a foundation for information consumers to subjectively
> evaluate the trustworthiness of information found on the Semantic Web 
> using
> a formally defined framework.

I like the first version above better.


Patrick


>
> I will include some other changes, that I have discussed with Jeremy, 
> and
> send an updated version of the paper tonight.
>
> Chris
>
>
> ----- Original Message -----
> From: "Jeremy Carroll" <jjc@hplb.hpl.hp.com>
> To: "Jeremy Carroll" <jjc@hplb.hpl.hp.com>
> Cc: "Pat Hayes" <phayes@ihmc.us>; "Patrick Stickler"
> <patrick.stickler@nokia.com>; <www-archive@w3.org>; "ext Chris Bizer"
> <chris@bizer.de>
> Sent: Thursday, April 08, 2004 3:35 PM
> Subject: Re: Named graphs next draft
>
>
>>
>> Locks etc.
>>
>> Chris currently has the latex sources with lock.
>> Later today, he should send these sources to Pat and the archive and 
>> Pat
>> can either change the latex sources or write plain text (like last 
>> time).
>>
>> Chris would like the lock on Tuesday UK time, I would like the lock on
>> Wednesday.
>>
>> Pat could have the lock from this evening through to Monday night.
>>
>> Hope this works,
>>
>> Chris and Pat can probably sort things.
>>
>> Please make sure there is an agreed abstract on the archive soon, 
>> since I
>> will submit it Monday.
>>
>> Jeremy
>>
>>
>
>
>

--

Patrick Stickler
Nokia, Finland
patrick.stickler@nokia.com
Received on Tuesday, 13 April 2004 02:28:12 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Wednesday, 7 November 2012 14:17:42 GMT