W3C home > Mailing lists > Public > www-rdf-interest@w3.org > November 2003

Re: making statements about a graph

From: Steve Harris <S.W.Harris@ecs.soton.ac.uk>
Date: Thu, 6 Nov 2003 10:43:39 +0000
To: www-rdf-interest@w3.org
Message-ID: <20031106104339.GB7504@ecs.soton.ac.uk>

On Thu, Nov 06, 2003 at 11:27:40 +0100, Max Froumentin wrote:
> 
> Steve Harris <S.W.Harris@ecs.soton.ac.uk> wrote:
> 
> > The RDF provided mechaism for reification is pretty messed up IMHO.
> 
> This reminds me that I never saw a clear statement explaining why it
> was messed up. I want to use it for voice recognition, to express
> confidence values for assertions:
> 
> <utterance id="u1">chat</utterance>
> 
> <rdf:RDF>
>   <rdf:Resource rdf:nodeID="r1" rdf:about="#u1" dc:language="EN"/>
>   <rdf:Resource rdf:nodeID="r2" rdf:about="#u1" dc:language="FR"/>
> 
>   <rdf:Resource rdf:about="#r1" foo:confidence="65%"/>
>   <rdf:Resource rdf:about="#r2" foo:confidence="35%"/>
> </rdf:RDF>

I dont think thats reified (though I'm not that hot on RDF syntax), I
think reified statements look something like:

  <rdf:Statement>
    <rdf:subject resource="#r1" />
    <rdf:predicate resource="foo:confidence" />
    <rdf:object>65%</rdf:object>
  </rdf:Statement>

representing one triple. But it doesnt entail the "obvious" triple.

IIRC, your exmaples are b-nodes.

- Steve
Received on Thursday, 6 November 2003 05:43:49 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 22:44:45 UTC