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
This archive was generated by hypermail 2.2.0+W3C-0.50 : Thursday, 1 October 2009 14:42:12 GMT