W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > October 2001

Re: A proposal for entailment tests

From: <jos.deroo.jd@belgium.agfa.com>
Date: Wed, 3 Oct 2001 01:27:36 +0100
To: jjc@hplb.hpl.hp.com
Cc: w3c-rdfcore-wg@w3.org
Message-Id: <OF7B4F4FD2.769557F6-ON41256ADA.00007EC8@bayer-ag.com>


> I like the outline of Jos's proposal very much.


> [I am neutral about Aaron's suggested modification.]
> As I see it, this allows a test application to:
>   read one or more manifest files that describe
>   + tests using rdf-entailment or rdfs-entailment
> It can then scan through these looking for tests that are relevant to the
> sort of application it tries to be.


> The manifest file makes no assumptions as to the implementation of the
> application (other than it is able to read rdf/xml files!).

this is good text to be in the TC WD

> As an example, I understand Jos's implementation uses a reasoner of some
> sort,

prolog family (maybe)

> so that his test suite might check the rdfs-entailment by checking
> that each statement in the rhs does follow from the lhs.
> A different implementation of rdfs might be a Jena inferencing model, which
> is automatically closed using Pat's model theory (call for
> implementations!).

yes, that's what we really have to do!
backup with running code, no excuse!

> Such an implementation would read the LHS files and check
> that the RHS files were sub-graphs.


> Also Jos's proposal includes the current tests, despite somewhat hiding
> their intent. It also encompasses my proposal to have tests where two RDF
> files with the same graph are given.

that's true

> One note: the current "equality" tests are computational less expensive than
> an rdf entailment test. Technically it is the difference between Graph
> Isomorphism and SubGraph Isomorphism. GI is thought to be strictly between P
> and NP where SubGraph Iso is known to be NP. For these reason it may be
> desirable to either:
> + add rdfEquivalent and rdfsEqualivalent predicates
> or make sure we use cycles, and suggest that users of the test cases should
> search for such cycles if they have a GI algorithm available.

i lean more towards the cycles...
but can live with equivalent

> Another advantage of Jos's propsoal is that it is extensible. If we come up
> with new tests that don't fit the framework we can extend the framework.
> +1



PS I started "etc" (with the help of Art) to put some testcases/support
   at http://www.w3.org/2000/10/rdf-tests/rdfcore/entailment/
   but you have to accept some N3 for that (should be straightforward)
   and I'm also looking forward to Pat's novel work on rdf and rdfs rules
   and it also directly includes some running code stuff to support it
Received on Tuesday, 2 October 2001 19:30:03 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 20:24:05 UTC