W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > October 2001

Re: NP completeness & rdf entailment, graph identity, MT etc.

From: Pat Hayes <phayes@ai.uwf.edu>
Date: Mon, 8 Oct 2001 19:11:17 -0500
Message-Id: <p05101018b7e7eec414b0@[205.160.76.193]>
To: jos.deroo.jd@belgium.agfa.com
Cc: w3c-rdfcore-wg@w3.org
>[...]
>>  A:
>>
>>  <uri> <pred> <uri2> .
>  > <uri> <pred> <uri2> .
>>
>  > B:
>>
>  > <uri> <pred> <uri2> .
>  >
>  > C:
>>
>>  <uri> <pred> <uri2> .
>  > <uri> <pred> _:bnode .
>>
>  > D:
>>
>>  <uri> <pred> <uri2> .
>>  <uri> <pred> _:bnode .
>  > _:bnode <pred> _:bnode2 .
>>
>(after some bug corrections) we currently find that
>   A simple-entails A
>   A simple-entails B
>   A simple-entails C
>   B simple-entails A
>   B simple-entails B
>   B simple-entails C (follows from B --> A --> C)
>   C simple-entails A
>   C simple-entails B (follows from C --> A --> B)
>   C simple-entails C
>   D simple-entails A
>   D simple-entails B (follows from D -->A -->B, and similarly for rest)
>   D simple-entails C
>   D simple-entails D
>and we *fail* to find that
>   A simple-entails D
>   B simple-entails D
>   C simple-entails D

I am *extremely* pleased to hear that, Jos :-)

Now could you also try E:

<uri> <pred> <uri2> .
<uri> <pred> _:bnode .
_:bnode2 <pred> _:bnode

Which ought to be simple-equivalent to (entail and entailed by) all 
of A, B and C (but you really only need to check one of them :-)

Pat

-- 
---------------------------------------------------------------------
IHMC					(850)434 8903   home
40 South Alcaniz St.			(850)202 4416   office
Pensacola,  FL 32501			(850)202 4440   fax
phayes@ai.uwf.edu 
http://www.coginst.uwf.edu/~phayes
Received on Monday, 8 October 2001 20:11:24 EDT

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