- From: McBride, Brian <bwm@hplb.hpl.hp.com>
- Date: Wed, 3 May 2000 12:02:09 +0100
- To: "'Graham Klyne'" <GK@Dial.pipex.com>, "McBride, Brian" <bwm@hplb.hpl.hp.com>
- Cc: www-rdf-interest@w3.org, CC/PP WG list <w3c-ccpp-wg@w3.org>
> >This is roughly my original suggestion, but I see one fundamental >problem. It is my understanding that one of the intended >goals of RDF is >anybody can come along and make a new statement about an existing RDF >resource. Just like with a natural language, the system is >not closed. (A >consequence of this is that, in general, there can be no guarantee of >consistency in a collection of RDF statements: an RDF subgraph with >additional constraints is needed for reasoning to be a useful process.) > >In the case of your example above, suppose I later wish to add >the assertion: > > [ccppX:DeviceCapsStatement] > --ccppX:capabilities--> [ ] --ccppX:colours--> "3" > >This adds a new arc to the RDF graph that appears to be >assured as "Brian >says this", which which (by virtue of the construction >sequence described) >we know is not the case. > If the question is just about representation, then would adding a new device caps resource deal with this. <rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ccppX="..."> <ccppX:DeviceCapsStatement> <ccppX:device>...</ccppX:device> <ccppX:assurance>Brian Says This</ccppX:assurance> <ccppX:capabilities> <ccppX:colours>2</ccppX:colours> <ccppX:keyboard>12 digit pad</ccppX:keyboard> ... ... </ccppX:capabilities> </ccppX:DeviceCapsStatement> <ccppX:DeviceCapsStatement> <ccppX:device>...</ccppX:device> <ccppX:assurance>Graham Says This</ccppX:assurance> <ccppX:capabilities> <ccppX:colours>3</ccppX:colours> ... ... </ccppX:capabilities> </ccppX:DeviceCapsStatement> </rdf:RDF> You'd need to figure out which to believe, but that seems doable. And this is just representation. You still have to figure whether to believe the representation. It would be interesting to know how you are proposing to do that. Brian
Received on Wednesday, 3 May 2000 07:02:16 UTC