W3C home > Mailing lists > Public > www-rdf-comments@w3.org > April to June 2003

keeping RDFS closure finite

From: Dan Connolly <connolly@w3.org>
Date: 06 Jun 2003 15:44:15 -0500
To: www-rdf-comments@w3.org
Message-Id: <1054932254.8234.3576.camel@dirk.dm93.org>

I think this is an editorial matter...

"However, since none of these triples entail any of the others, it is
only necessary, in practice, to add the triples which use those
container properties which actually occur in any particular graph or set
of graphs in order to check the rdfs-entailment relation between those
graphs."

  -- http://www.w3.org/TR/rdf-mt/

how about making that in theory as well as
in practice?

i.e. change
section 3.3 RDFS interpretations so
that only the rdf:_N terms in
the vocabulary of the interpretation
are axiomatically related to
rdfs:ContainerMembershipProperty.


If that would break or change in a way that's
observable from entailment tests, then
never mind.

-- 
Dan Connolly, W3C http://www.w3.org/People/Connolly/
Received on Friday, 6 June 2003 16:43:43 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Friday, 21 September 2012 14:16:32 GMT