W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > February 2002

Re: reification test case

From: Patrick Stickler <patrick.stickler@nokia.com>
Date: Tue, 05 Feb 2002 13:58:46 +0200
To: ext Bill de hÓra <dehora@eircom.net>, RDF Core <w3c-rdfcore-wg@w3.org>
Message-ID: <B8859596.D3DD%patrick.stickler@nokia.com>
On 2002-02-05 12:46, "ext Bill de hÓra" <dehora@eircom.net> wrote:

>> From: Patrick Stickler [mailto:patrick.stickler@nokia.com]
>>> ... How is the bnode in a  reification 'linked to' the
>>> triple that is being described? Does that question even make sense?
>>> Pat
>> My take is that the reification is "linked to" a specific
>> triple based on the S, P, and O values.
> I used to think the same thing. But I don't know if there is any such
> link going from reification to triple. Well...maybe there is. If a
> triple can have only 1 reification, then is it reasonable to infer the 1
> triple on encountering that 1 reification?
> Bill de hÓra

For some reason I get the impression that alot of folks
are thinking "line in some ntriples file" when they
think of triple rather than simply the combination
of three elements, S, P, and O.

A triple is an abstract entity. It has no explicit
representation in the graph. It is only inferred from
the presence of an arc from one node to another node
or literal.


Patrick Stickler              Phone: +358 50 483 9453
Senior Research Scientist     Fax:   +358 7180 35409
Nokia Research Center         Email: patrick.stickler@nokia.com
Received on Tuesday, 5 February 2002 07:04:09 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 14:53:55 UTC