W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > January to March 2006

Re: Editorial thread for BGP matching

From: Enrico Franconi <franconi@inf.unibz.it>
Date: Wed, 25 Jan 2006 18:55:02 +0100
Message-Id: <FA88A364-881A-4C84-A0CD-F8FEE07B2372@inf.unibz.it>
Cc: RDF Data Access Working Group <public-rdf-dawg@w3.org>
To: andy.seaborne@hp.com

On 25 Jan 2006, at 18:41, Seaborne, Andy wrote:
> Enrico Franconi wrote:
>> Another proposed simplification:
>> Currently:
>> Definition:  Scoping Set
>> A Scoping Set B is a set of RDF terms formed by the combination of:
>>      * all URIs
>>      * blank node names
>> This could just be:
>> A Scoping Set is an arbitrary subset of the RDF terms.
> I thought the point was that it is always all IRIs (oops s/URI/IRI)  
> and some set of blank nodes (but not all of them).  That then ties  
> to "The identifiers introduced by S all occur in B." in the BGP  
> matching defn.

Well, yes, you are right.

Received on Wednesday, 25 January 2006 17:55:52 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:00:50 UTC