- From: Enrico Franconi <franconi@inf.unibz.it>
- Date: Thu, 19 Jan 2006 23:38:00 +0100
- To: Enrico Franconi <franconi@inf.unibz.it>
- Cc: Pat Hayes <phayes@ihmc.us>, RDF Data Access Working Group <public-rdf-dawg@w3.org>
On 19 Jan 2006, at 23:32, Enrico Franconi wrote: >> Im happy to have some prose pointing out that simple entailment is >> nothing more than structural matching to a subgraph, allowing for >> instances to bnodes; and emphasizing that nothing that is not >> already in the actual graph needs to be inferred or constructed, >> even implicitly. This is pretty much a restating of the >> interpolation lemma (http://www.w3.org/TR/rdf-mt/#interplemmaprf) >> in the RDF semantics document. > > This is what more or less is already in my text in the > "implementational hint" part - but your formulation sounds partly > better. > However, note that your current text does *not* provide for this > obviously expected equivalence. I am wrong, it does, actually. It does not characterise the told bnodes extension, which is another story, though. --e.
Received on Thursday, 19 January 2006 22:38:13 UTC