- From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
- Date: Thu, 02 Jan 2003 18:37:16 -0500 (EST)
- To: jjc@hpl.hp.com
- Cc: www-webont-wg@w3.org
From: Jeremy Carroll <jjc@hpl.hp.com> Subject: Mapping rules Jan 2nd Date: Thu, 2 Jan 2003 23:33:37 +0100 > > > Peter, > > in the current version of mapping rules (getting better and better) > you say: > > > [[ > An RDF graph is an OWL/DL graph if: > 1. > 2. > 3. > 4. > ]] > > I did not see a condition that all restrictions had to be blank nodes. > I have not worked through the more detailed conditions above that part. > > Jeremy A restriction that is not a blank node does not match with the definition of a description here. This would prevent the disjoint partition of the triples of the graph that is needed in 3. peter
Received on Thursday, 2 January 2003 18:37:28 UTC