W3C home > Mailing lists > Public > public-rif-wg@w3.org > July 2006

Re: [ALL] Homework for July 25 telecon

From: Francois Bry <bry@ifi.lmu.de>
Date: Tue, 25 Jul 2006 15:48:36 +0200
Message-ID: <44C62134.80308@ifi.lmu.de>
To: "Public-Rif-Wg (E-mail)" <public-rif-wg@w3.org>

Dear RIFler,

Hier are a few comments to Axel's very good proposal:
> Axel's proposed RIFRAF questionnaire (for evaluating/populating the
> framework): [http://www.w3.org/2002/09/wbs/38457/RAFQuestionnaire/]
The following question under 3.1 seems to me ambigous: "Is your language
decidable?" Decidability of a language usually means, at least in
theoretical Computer Science, that whether a word (= program) belongs to
the language is decidable.This is the case for all programming and
modelling languages. My understanding is that Axel would like to ask
instead whether the termination of programs is decidable.

Convcering 3.2, I would suggest ot ask whether the model theory is
defined in a Tarskyan style, i.e. by means of a valuation function
recursively defined on a formulas (or program  expression) strucure like
classical logic models or by some other manes like well-founded or
stable models. This distinction is essential for the evaluation of a
rule-based language. Basically: rule languages with a Tarskyan model
theory are "easy" to evaluate.

I would suggest to add a question whether the language has means to
access data in Web formats such as HTML, XML, RDF, OWL data.

Regards,

Francois
Received on Tuesday, 25 July 2006 13:48:56 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 2 June 2009 18:33:30 GMT