- From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
- Date: Fri, 23 Aug 2002 16:11:18 -0400 (EDT)
- To: sandro@w3.org
- Cc: seth@robustai.net, sean@mysterylights.com, www-rdf-interest@w3.org
From: Sandro Hawke <sandro@w3.org> Subject: Re: A Rough Guide to Notation3 Date: Fri, 23 Aug 2002 16:00:30 -0400 [...] > > Is the meaning compatible with the RDF > > meaning of the triples that encode the sentences? > > 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.]] peter
Received on Friday, 23 August 2002 16:16:31 UTC