keeping RDFS closure finite

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


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

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

Dan Connolly, W3C

Received on Friday, 6 June 2003 16:43:43 UTC