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

Re: "OWL" Entailment

From: Ivan Herman <ivan@w3.org>
Date: Thu, 07 May 2009 13:11:11 +0200
Message-ID: <4A02C1CF.7030701@w3.org>
To: Bijan Parsia <bparsia@cs.man.ac.uk>
CC: SPARQL Working Group <public-rdf-dawg@w3.org>


Bijan Parsia wrote:
> 
>> RDFS might be similar (disregarding the issue of infinite triple
>> generation with rdf:_n, but the approach in Herman ter Horst's paper
>> might take care of making that finite...)
> 
> ?

He looks at the graph, finds the maximum 'n' for which rdf:_n is in the
graph, and uses the axiomatic triples for rdf:_i 0<=i<=n only. It is not
kosher from the standard point of view, but it works for applications...

Ivan

> 
> Cheers,
> Bijan.
> 
> 

-- 

Ivan Herman, W3C Semantic Web Activity Lead
Home: http://www.w3.org/People/Ivan/
mobile: +31-641044153
PGP Key: http://www.ivan-herman.net/pgpkey.html
FOAF: http://www.ivan-herman.net/foaf.rdf

Received on Thursday, 7 May 2009 11:11:49 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:38 GMT