W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > November 2001

Another use-case for "reification"

From: Graham Klyne <GK@NineByNine.org>
Date: Fri, 02 Nov 2001 13:49:08 +0000
Message-Id: <5.1.0.14.2.20011102133749.03c2a450@joy.songbird.com>
To: RDF core WG <w3c-rdfcore-wg@w3.org>
How can one express fine-grained access-control requirements about an RDF 
graph?

E.g. I convey a number of assertions to some other party, but wish to 
assert that some or all of the information is confidential.  Further, 
consider that some of the information is available separately from a source 
which gives permission for the statements to be freely redistributed.  How 
can this access control information be captured and used by an RDF 
application?  Most possible solutions seem to lead back to some form of 
that structure that has been called "reification".  Also use of constructs 
like rdf:aboutEach/bagId might be useful.

I think many variations are possible here.

This has arisen from a private discussion that I'm hoping to get permission 
to post some details from, if that is helpful.

#g


------------
Graham Klyne
(GK@ACM.ORG)
Received on Friday, 2 November 2001 08:51:39 EST

This archive was generated by hypermail pre-2.1.9 : Wednesday, 3 September 2003 09:42:28 EDT