Sat, 31 Dec, 2005
An RDFS Closure module
I played with some more codings a few weeks ago: I turned the RDFS Closure algorithm of Herman ter Horst [1] into Python, on top of RDFLib. It generates the RDFS closure of an RDF Graph. Ie, triples that are inferred by virtue of RDFS Semantics can be then retrieved from the Graph. Combined with sparql-p, for example, it may be pretty useful… (at least I hope). I am sure there are still bugs, though 
The code is a single Python file, but you can also download a distribution file containing the documentation. The latter is also available on-line.
[1] Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary, Herman J. ter Horst, Journal of Web Semantics, (2005) 79-115. Unfortunately, as far as I know, the paper is not available on-line. Category: /WorkRelated/SemanticWeb/RDFLib; Posted at: 15:50 UTC; Permalink