W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > July to September 2005

Re: subgraph/entailment

From: Steve Harris <S.W.Harris@ecs.soton.ac.uk>
Date: Thu, 8 Sep 2005 10:21:09 +0100
To: RDF Data Access Working Group <public-rdf-dawg@w3.org>
Message-ID: <20050908092109.GC19408@login.ecs.soton.ac.uk>

On Wed, Sep 07, 2005 at 01:44:52 -0500, Dan Connolly wrote:
> > > In SPARQL QL, you start with some RDF dataset (i.e. a bunch of
> > > graphs). How you got there is your business, but we expect
> > > one of the popular ways is by grabbing data off the web and
> > > computing, say, the RDFS closure of it.
> > 
> > Do you find Enrico's point that equivalent graphs can return different 
> > sets of hits interesting or worth considering?
> 
> It's interesting enough to put it in the test suite, to say yes,
> we thought about that, and yes, we meant that.
> 
> REQUEST FOR TESTCASE.
> If the test suite maintainers haven't done their magic by
> the time I send out the next agenda, somebody please remind me.

I think we have a test that converes this allready, at least in part:

http://www.w3.org/2001/sw/DataAccess/tests/#dawg-unsaid-003

though it uses obsolete syntax.

I'l add the Property one later though.

- Steve 
Received on Thursday, 8 September 2005 09:21:26 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:24 GMT