W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > February 2002

Re: reification test case

From: Jos De_Roo <jos.deroo.jd@belgium.agfa.com>
Date: Tue, 5 Feb 2002 02:02:11 +0100
To: "Pat Hayes <phayes" <phayes@ai.uwf.edu>
Cc: "w3c-rdfcore-wg" <w3c-rdfcore-wg@w3.org>
Message-ID: <OF24F3B08D.E95E227E-ONC1256B57.0004F8AC@agfa.be>

[...]

> >after all, bNodes are blank (circles with nothing in)
>
> Ah, no. Wait a minute. Those two triples *in isolation* describe
> identical graphs, but that doesn't mean you can arbitrarily
> substitute one for another in a larger graph.

really sorry for my sloppy words...
(I should have known that after all the
good lessons I learned from you...)

> For example these are
> NOT the same graph:
>
> _:x foo baz
> _:x woog plaz
>
> _:y foo baz
> _:x woog plaz
>
> The first has 3 nodes, the second has 4 nodes. And they don't have
> the same entailments, either. The first entails the second, but not
> vice versa.

exactly, we get

C:\n3>java Euler pat1.nt pat2.nt
# Generated with http://www.agfa.com/w3c/euler/#R29034 on Tue Feb 05
01:53:54 CET 2002
# for query file:/n3/pat2.nt
# given [file:/n3/pat1.nt]

@prefix log: <http://www.w3.org/2000/10/swap/log#>.

[ <http://example.org/eg#woog>
  <http://example.org/eg#plaz>]  .
[ <http://example.org/eg#foo>
  <http://example.org/eg#baz>]  .

# Proof found for file:/n3/pat2.nt in 2 steps (1719 steps/sec)


C:\n3>java Euler pat2.nt pat1.nt
# Generated with http://www.agfa.com/w3c/euler/#R29034 on Tue Feb 05 01:54:04 CET 2002
# for query file:/n3/pat1.nt
# given [file:/n3/pat2.nt]

# No proof found for file:/n3/pat1.nt in 2 steps (1865 steps/sec)

--
Jos
Received on Monday, 4 February 2002 20:02:49 EST

This archive was generated by hypermail pre-2.1.9 : Wednesday, 3 September 2003 09:45:04 EDT