- From: Francois Bry <bry@ifi.lmu.de>
- Date: Tue, 25 Jul 2006 15:48:36 +0200
- 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 UTC