W3C home > Mailing lists > Public > www-rdf-interest@w3.org > January 2001

RE: RDF IG meeting at W3C Technical Plenary 2001-02-28

From: Peter F. Patel-Schneider <pfps@research.bell-labs.com>
Date: Tue, 23 Jan 2001 14:06:14 -0500
To: danbri@w3.org
Cc: matola@oclc.org, seth@robustai.net, www-rdf-interest@w3.org
Message-Id: <20010123140614N.pfps@research.bell-labs.com>
From: Dan Brickley <danbri@w3.org>
Subject: RE: RDF IG meeting at W3C Technical Plenary 2001-02-28
Date: Tue, 23 Jan 2001 13:26:23 -0500 (EST)

> Hi Tod,
> 
> In http://www.w3.org/TandS/QL/QL98/pp/enabling.html we present a simple
> query language where...
> 
> [[
> The query is itself simply an RDF model (i.e., a directed labelled graph),
> some of whose resources and properties may represent
> variables. There are two outputs to every query,
> 
>     1.A subgraph (of the KB against which the query is issued) which
> 	matches the query.
>     2.A table of sets of legal bindings for the variables, i.e., when
> 	these bindings are applied to the variables in the query, we get
>        (1).
> ]]

How do you propose to define ``match'' here, particularly in RDFS, where
there are subclasses and subproperties?

Peter Patel-Schneider
 
Received on Tuesday, 23 January 2001 14:08:06 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:47 GMT