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

Re: entailment-from-inconsistent-graph: new test case request

From: Jan Grant <Jan.Grant@bristol.ac.uk>
Date: Sun, 2 Nov 2003 16:19:28 +0000 (GMT)
To: Jeremy Carroll <jjc@hpl.hp.com>
Cc: w3c-rdfcore-wg@w3.org
Message-ID: <Pine.GSO.4.58.0311021610130.18110@mail.ilrt.bris.ac.uk>

On Sun, 2 Nov 2003, Jeremy Carroll wrote:

> while sympathetic to Jan's desire for meangingful test cases, I note that
> peter's test (particualrly the choice of conclusion) depends on a somewhat
> non-obvious technicality.
>
> false does-not-simply-entail G
>
> for any non-empty G, because G uses at least one URI which is not in all
> interpretations of false.

[[
if E is a ground triple s p o . then I(E) = true if

s, p and o are in V, I(p) is in IP and <I(s),I(o)> is in IEXT(I(p))

otherwise I(E)= false.
]]
... would seem to catch ground non-empty G's, and I think the semantic
conditions for blank nodes are ok too; G comes out false under an
interpretation which doesn't contain a URI in G.




-- 
jan grant, ILRT, University of Bristol. http://www.ilrt.bris.ac.uk/
Tel +44(0)117 9287088 Fax +44 (0)117 9287112 http://ioctl.org/jan/
"...perl has been dead for more than 4 years." - Abigail in the Monastery
Received on Sunday, 2 November 2003 11:20:45 EST

This archive was generated by hypermail pre-2.1.9 : Sunday, 2 November 2003 11:20:47 EST