Re: what RDF is not (was Re: RDF/XML Syntax Specification (Revised) W3C Working Draft published)

From: jos.deroo.jd@belgium.agfa.com
Subject: Re: what RDF is not (was Re: RDF/XML Syntax Specification (Revised) W3C Working Draft published)
Date: Thu, 20 Dec 2001 22:15:53 +0100

[...]

> Indeed (but...)
> 
> Let's take graph1 (but not assert it)

How (in RDF)?

>   _:child gc:childIn _:family .
>   _:parent gc:spouseIn _:family .
> 
> and let's take graph2 (but not assert it)

Ditto.

>   _:aaa gc:parent _:bbb .
> 
> and let's
> 
>   o assume that bnode _:child is same thing as bnode _:aaa

How (in RDF)?

>   o assume that bnode _:parent is same thing as bnode _:bbb

Ditto.

>   o assert that graph1 logically implies graph2

Ditto.

> From the ``implies'' scope the bnodes in graph1
> are actually universally quantified variables
> (and in this case also the bnodes of graph2
> but not in the general case, where they
> are only existentially quantified).
> That is a FOL entailment rule
> which we can simply write as
> 
>   { ?child gc:childIn ?family . ?parent gc:spouseIn ?family }
>     log:implies { ?child gc:parent ?parent } .
> 
> No?

I really don't know what you are trying to get at here.
Are you trying to show that RDF has some power that one might not think
that it has?  If so, you need to show that all the steps above can be
performed within RDF.

> --
> Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/


peter

Received on Thursday, 20 December 2001 16:29:23 UTC