W3C home > Mailing lists > Public > www-rdf-rules@w3.org > February 2003

Re: RDF query testcase requirements: IRC chat?

From: Eric Miller <em@w3.org>
Date: 18 Feb 2003 19:34:07 -0500
To: "R.V.Guha" <guha@guha.com>
Cc: Geoff Chappell <geoff@sover.net>, www-rdf-rules@w3.org
Message-Id: <1045614848.3589.2120.camel@cherry>

On Sat, 2003-02-15 at 14:10, R.V.Guha wrote:
> Geoff,
>   I think this approach will be an abuse of RDF. It treats the 
> data model as a syntax. Parsers are quite trivial to write, so 
> that should not be a concern.
>   Regarding the other point you made about selecting variables 
> vs graphs --- the two are equivalent. Reaching back into the 
> dark mists of time, a paper that Eric Miller, Ora Lassila, Dan 
> Brickley and I wrote for QL 98 (called Enabling Inference) 
> proposed sub-graph matching, which is the basic operation 
> performed by any deductive engine, as the basis of a query 
> system. I can't find that paper, but I think it showed how the 
> two (selecting variables vs subgraphs) are equivalent. In any 
> case, all one has to show is that a *set* of graphs in which 
> nodes can be variables can be mapped into conjunctive normal 
> form and vice versa.

Enabling Inferencing

R.V. Guha (Netscape) <guha@netscape.com>
Ora Lassila (Nokia) <ora.lassila@research.nokia.com>
Eric Miller (OCLC) <emiller@oclc.org>
Dan Brickley (ILRT, University of Bristol)

Date: 18 Nov 1998
-- http://www.w3.org/TandS/QL/QL98/pp/enabling.html

eric miller                              http://www.w3.org/people/em/
semantic web activity lead               http://www.w3.org/2001/sw/
w3c world wide web consortium            http://www.w3.org/
Received on Tuesday, 18 February 2003 19:36:40 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 22:46:15 UTC