Re: A Rough Guide to Notation3

> > 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