W3C home > Mailing lists > Public > www-rdf-logic@w3.org > November 2001

Re: DAML+RDFS: potentials for simplifications?

From: Seth Russell <seth@robustai.net>
Date: Thu, 29 Nov 2001 10:29:05 -0800
Message-ID: <015701c17903$ba87a880$657ba8c0@c1457248a.sttls1.wa.home.com>
To: "Peter Crowther" <peter.crowther@networkinference.com>
Cc: <www-rdf-logic@w3.org>
From: "Peter Crowther" <peter.crowther@networkinference.com>

> > Sure, it's feasible!   Follow the database records to
> > where the rules are coded in a language that is
> > understood by your coded in a language that is
> > understood by your programs.  Here, this is one
> > way you could do it:
> > http://robustai.net/mentography/disjointWith.gif
>
> All this does is to shift the burden onto ever-more-complex programs, of
> whatever nature, that must then be embedded into all Semantic Web-aware
> clients.

There is no reason to embed them in *all* clients ... just those that want
to be semantically aware but not restrained by  the limitations of DMAL.
The path for finding the KIF rule is in no way complex; and there are lots
of programs that can draw inferences from these KIF rules, as you well know.

>Unless, Seth, you have found a way around Godel's Incompleteness
> Theorem [1]?

How is Godel's Incompletness Theorem involved here.  Could you explain?

Seth Russell
Received on Thursday, 29 November 2001 13:31:54 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 5 February 2014 07:16:02 UTC