W3C home > Mailing lists > Public > public-owl-dev@w3.org > October to December 2008

Fwd: Mapping to RDF Graphs and reification

From: Daniel Mahler <dmahler@gmail.com>
Date: Wed, 3 Dec 2008 18:46:03 +0100
Message-ID: <b1ea05a0812030946l3eff0e32le812220ae7042e05@mail.gmail.com>
To: public-owl-dev@w3.org

Bijan,

On Wed, Dec 3, 2008 at 6:03 PM, Bijan Parsia <bparsia@cs.man.ac.uk> wrote:
>
> On 3 Dec 2008, at 16:49, Jeff Thompson wrote:
....
> Personally, I think this is the least interesting problem with reification,
> if it is a problem at all :)
>
> It's definitely not a problem for the non-Full versions of OWL since all
> this stuff is mere syntax. The way we're using it, we typically *want* the s
> to denote something in the domain, and, in fact, to denote the same object.
>
> Consider:
>        s p o
>        not(s p o)
>
> (where the second is a negated triple). We want these to contradict. The

If you represent negation by reification,
how do you avoid Tarski's paradox?

(I asked this question question on a w3 rdf list many years ago
and I still do not know)

cheers
Daniel

> latter is serialized using the owl reification vocabulary. So we want those
> ss, ps, and os to be talking about the same thing at the same time.
>
> Thus, I don't think that's a problem.
>
> Hope this helps.
>
> Cheers,
> Bijan.
>
>
>
Received on Wednesday, 3 December 2008 18:16:33 GMT

This archive was generated by hypermail 2.3.1 : Wednesday, 27 March 2013 09:32:56 GMT