W3C home > Mailing lists > Public > www-rdf-interest@w3.org > August 2002

Re: A Rough Guide to Notation3

From: Sandro Hawke <sandro@w3.org>
Date: Fri, 23 Aug 2002 16:41:48 -0400
Message-Id: <200208232041.g7NKfm316068@wadimousa.hawke.org>
To: "Peter F. Patel-Schneider" <pfps@research.bell-labs.com>
cc: seth@robustai.net, sean@mysterylights.com, www-rdf-interest@w3.org


> > Yes.  I believe my approach of translating RDF to FOL means that a
> > proof of the satisfiability of my axioms is a proof of their
> > compatibility with RDF.  (I'll need to add some more axioms for RDFS
> > inference to be complete here.)
> 
> You might want to look at some of the discussions on representing FOL
> sentences in n-triples while still retaining the RDF still retaining their
> RDF meaning.  [[Summary: you can't, at least not without some lossage.]]

I've heard that conclusion (from you), but been unable to find the
evidence to support it.  Can you send me a pointer?

     -- sandro
Received on Friday, 23 August 2002 16:42:14 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:55 GMT