W3C home > Mailing lists > Public > public-swd-wg@w3.org > September 2007

Re: SKOS queries

From: Sean Bechhofer <sean.bechhofer@manchester.ac.uk>
Date: Tue, 25 Sep 2007 16:01:07 +0100
Message-Id: <7D1A972B-6A69-4BEC-B4A9-D4CCF960D1A8@manchester.ac.uk>
Cc: SWD WG <public-swd-wg@w3.org>
To: Quentin Reul <qreul@csd.abdn.ac.uk>


On 24 Sep 2007, at 11:41, Quentin Reul wrote:

> Hi,
>
> I have looked at different aspects of SKOS and I have got a few  
> questions as a result:
>
> First of all, I was wondering if there was any reasoner available  
> to create a thesaurus tree and find out all the different terms  
> that are "broader/narrower" for a given term.
>
> My understanding is that the "broader/narrower" relationship is  
> transitive, i.e. if the user adds a term has being broader, this  
> term would have the previous term as narrower without having to add  
> the statement to the second term.

Broader/narrower are intended to be *inverses*, which I think is what  
you mean here.

The transitivity of broader/narrower is one of the topics that's up  
for discussion at the F2F. See "Semantic Relation Properties" in [1].

Cheers,

	Sean

[1] http://www.w3.org/2006/07/SWD/wiki/AmsterdamAgenda

--
Sean Bechhofer
School of Computer Science
University of Manchester
sean.bechhofer@manchester.ac.uk
http://www.cs.manchester.ac.uk/people/bechhofer
Received on Tuesday, 25 September 2007 15:01:32 UTC

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