W3C home > Mailing lists > Public > public-owl-wg@w3.org > April 2008

Re: Axiomatic triples in OWL-R-Full?

From: Ivan Herman <ivan@w3.org>
Date: Wed, 09 Apr 2008 13:25:14 +0200
Message-ID: <47FCA79A.1000807@w3.org>
To: Michael Schneider <schneid@fzi.de>
CC: W3C OWL Working Group <public-owl-wg@w3.org>

Michael Schneider wrote:
> Such a "on demand" introduction of axiomatic triples would probably put a slight burdon on the implementors to do some preprocessing on the input graph in order to create the necessary axiomatic triples. But this shouldn't be no big deal in practice, I suppose. Perhaps for very large RDF graphs contained in databases, but people will certainly come to clever ideas like "lazy axiomatic triple introduction" or whatever.

Well... I actually did implement an RDFS closure in Python some times 
ago following ter Horst's description[1]. It was really not a big deal.


[1] http://www.ivan-herman.net/Misc/PythonStuff/RDFSClosure/

> Cheers,
> Michael

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

Received on Wednesday, 9 April 2008 11:25:47 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 21:42:03 UTC