- From: Jeremy Carroll <jjc@hplb.hpl.hp.com>
- Date: Wed, 28 May 2003 09:35:56 +0100
- To: pat hayes <phayes@ai.uwf.edu>
- CC: Brian McBride <bwm@hplb.hpl.hp.com>, w3c-rdfcore-wg@w3.org
pat hayes wrote: >> We note that it is possible to build more strictly layered languages >> on top of RDF(S), Owl DL/Lite being examples. > > > That might be well worth articulating in more detail. I think we could > do a fairly exact job on this which a lot of people would find helpful. > Since Jeremy has already done the donkey work for this in defining how > to tell if an OWL-RDf graph is in OWL-DL ( which is precisely the > 'layered' subset of OWL in this sense), we should be able to easily > adapt his algorithm to define a 'layered style' of writing RDF and put > it in an appendix somewhere. I am willing to tackle writing a draft of > this. It would be relevant to vass-01, pan-01 and Qu-03. > > Pat While I am not convinced of the value of this exercise I am happy to contribute an articulation of the intersection of OWL Lite and RDFS, with a few sensible relaxations (like allowing cycles of bnodes). Jeremy
Received on Wednesday, 28 May 2003 04:36:24 UTC