W3C home > Mailing lists > Public > public-cwm-talk@w3.org > April to June 2009

Re: log:conjunction and named graphs

From: Dan Connolly <connolly@w3.org>
Date: Sun, 19 Apr 2009 17:51:35 -0500
To: Tim Berners-Lee <timbl@w3.org>
Cc: Henry Story <Henry.Story@Sun.COM>, public-cwm-talk@w3.org
Message-Id: <1240181495.17682.8338.camel@pav.lan>
On Fri, 2009-04-17 at 13:39 -0400, Tim Berners-Lee wrote:
> Henry,
> 
> 
> You are using owl:sameAs.
> 
> 
> cwm does not do owl:sameAs processing by default.
> 
> 
> It is an RDF processor, so it must be able to handle and input and
> output owl:sameAs graphs without processing
> 
> 
> There is some optional owl:sameAs processing with --closure=e  which
> does some smushing -- not much.

you might also try mixing in some rules about owl:sameAs:

{ ?u = ?uu. ?u ?p ?v. } => { ?uu ?p ?v }.
{ ?u ?p ?v. ?v = ?vv } => { ?u ?p ?vv }.

That's taken from 
  http://www.w3.org/2000/10/swap/util/owlth.n3

it's a cwm-happy elaboration of rdfp11
from ter-Horst's work.

# H.J. ter Horst, Completeness, Decidability and Complexity of
Entailment for RDF
# Schema and a Semantic Extension Involving the OWL Vocabulary, Revised
and
# extended version of [11], Journal of Web Semantics 3 (2005) 79-115.
# http://www.websemanticsjournal.org/ps/pub/2005-15


-- 
Dan Connolly, W3C http://www.w3.org/People/Connolly/
gpg D3C2 887B 0F92 6005 C541  0875 0F91 96DE 6E52 C29E
Received on Monday, 20 April 2009 12:17:03 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 20 April 2009 12:17:04 GMT