W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > April to June 2004

Re: requirement: rdfs query (for lack of a better name...)

From: Steve Harris <S.W.Harris@ecs.soton.ac.uk>
Date: Thu, 6 May 2004 22:35:15 +0100
To: public-rdf-dawg@w3.org
Message-ID: <20040506213514.GA12410@login.ecs.soton.ac.uk>

On Thu, May 06, 2004 at 08:15:06 +0100, Seaborne, Andy wrote:
> > Isn't that a question of what inference your RDFS engine supports?
> > 
> > If you do RDFS then (?x <rdfs:subclassOf> ?y) will give you
> > all the superclasses of ?y in ?x.
> Agreed, it does - but sometimes the application wants to find direct
> subclass relationships and sometimes all the transitive entailments. e.g.
> writing an editor. It is possible to want the both the direct relationship
> in one part of the query pattern and yet want RDFS inference elsewhere in
> the same query.

Yes, I've had some feature requests for non-infered triple patterns (so
only matching ground facts). Not for on-the-fly transitive closure, but I
can see why it could be useful.

- Steve
Received on Thursday, 6 May 2004 17:35:18 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 17:00:26 UTC