W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > June 2003

Semantics Wording

From: Brian McBride <bwm@hplb.hpl.hp.com>
Date: 17 Jun 2003 16:03:29 +0100
To: Pat Hayes <phayes@ai.uwf.edu>
Cc: rdf core <w3c-rdfcore-wg@w3.org>
Message-Id: <1055862208.2877.41.camel@dhcp-91-136.hpl.hp.com>

I noticed in section 4.2

RDFS Entailment Lemma. S rdfs-entails a graph E if and only if the
rdfs-closure of the merge of S with repect to the combined vocabulary of
S and E simply entails E.

I had trouble parsing that - what is a merge with respect to a
vocabulary?  I can't figure out what this means so can't suggest an
alternative, but do suggest and intro phrase:

A set of graphs S rdfs-entails ...

Received on Tuesday, 17 June 2003 11:04:00 UTC

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