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

Re: Efficient context mechanisms

From: Dave Reynolds <der@hplb.hpl.hp.com>
Date: Tue, 14 Jan 2003 12:20:04 +0000
Message-ID: <3E240074.2BAE77E2@hplb.hpl.hp.com>
To: Bob MacGregor <macgregor@ISI.EDU>
CC: www-rdf-interest@w3.org


Sorry to be slow to respond - I've been out of action for a couple of days.

> [Discussion on contexts]

> If you ever decide to get serious about contexts, it would probably be
> worth your
> while to assign someone the task of deciphering our context algorithm (or
> Austin's).
> It may be overkill for RDF, but some of the lessons learned probably apply to
> simpler context systems.

I agree. A serious context mechanism is not on our short term priority list but
it's an interesting area to think about in the longer term. The open world
assumption behind the semantic web makes it likely that some applications will
require non-monotonic reasoning, some forms of which would benefit from such an
efficient context mechanism. 

What is the space complexity of the algorithm like? 

[Let's move the Jena-specific discussions off rdf-interest, I'll reply
separately to that part of your message.]

Received on Tuesday, 14 January 2003 07:23:56 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 22:44:40 UTC