- From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
- Date: Fri, 16 May 2003 09:49:06 -0400 (EDT)
- To: hendler@cs.umd.edu
- Cc: www-webont-wg@w3.org
Status of some of the issues: From: Jim Hendler <hendler@cs.umd.edu> Subject: WOWG: contentive comment summary Date: Thu, 15 May 2003 19:09:05 -0400 [...] > RDFCore: NP completeness of owl/RDF mapping > http://lists.w3.org/Archives/Public/public-webont-comments/2003May/0052.html > > #owlsas-rdfcore-np-complete RDFCore notes the a consequence of the > rules for owl:equivalentClass is that distinguishing OWL DL from OWL > Full has complexity NP complete and suggests WEBONT investigate > whether this complexity can be reduced. > ASSIGNED: PETER P-S There is a proposal from quite a while ago (2 April) to change the mapping from including a spanning path to a connected (undirected) graph. I don't believe that this has made it into a telecon agenda item. peter
Received on Friday, 16 May 2003 09:49:19 UTC