On Fri, 2003-06-06 at 14:01, Christopher Welty wrote: > Dan, > > I find Peter's comments useful and directly to the point. RDFS not > decidable. No? What makes you think not? > I don't believe I've ever heard Pat claim otherwise. Yes, he has. to wit... "RDFS Entailment Lemma. S rdfs-entails E iff the rdfs-closure of S simply entails E." -- RDF Semantics W3C Working Draft 23 January 2003 Editor: Patrick Hayes http://www.w3.org/TR/2003/WD-rdf-mt-20030123/#prf -- Dan Connolly, W3C http://www.w3.org/People/Connolly/Received on Friday, 6 June 2003 16:03:25 GMT
This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:58:00 GMT