W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > July 2001

query and unification

From: Graham Klyne <GK@NineByNine.org>
Date: Tue, 03 Jul 2001 14:08:51 +0100
Message-Id: <5.0.2.1.2.20010703140258.0351d4d0@joy.songbird.com>
To: jos.deroo.jd@belgium.agfa.com
Cc: fmanola@mitre.org, connolly@w3.org, phayes@ai.uwf.edu, w3c-rdfcore-wg@w3.org
Hmmm...  my take is that querying is asymmetric, but unification is symmetric:

   (query Q D) != (query D Q)

but

   (unify E1 E2) == (unify E2 E1)

Maybe query is a special case of unification in which only one expression 
contains a variable to be substituted?

#g
--

At 01:08 AM 6/30/01 +0100, jos.deroo.jd@belgium.agfa.com wrote:

>that query thing is an interesting idea!
>when we try to unify 2 anonymous nodes it is actually
>like a query of one node against the other node
>(the latter node looking like an in-line set of statements)
>so the former one is existentially quantified
>whereas the latter one is universally quantified
>(and subjects match immediately (we use null's for them))
>and so everybody is right
>
>--
>Jos De Roo, AGFA http://www.agfa.com/w3c/jdroo/
Received on Tuesday, 3 July 2001 09:34:55 EDT

This archive was generated by hypermail pre-2.1.9 : Wednesday, 3 September 2003 09:38:06 EDT