W3C home > Mailing lists > Public > public-rif-wg@w3.org > May 2009

Re: AW: (PRD) Safeness and the semantics of conditions

From: Christian De Sainte Marie <csma@fr.ibm.com>
Date: Thu, 28 May 2009 16:36:29 +0200
To: "Adrian Paschke" <adrian.paschke@gmx.de>
Cc: "'Gary Hallmark'" <gary.hallmark@gmail.com>, "'RIF WG'" <public-rif-wg@w3.org>
Message-ID: <OF47083779.4BBF58FE-ONC12575C4.004FEDE7-C12575C4.00503E3A@fr.ibm.com>
Hi Adrian,

Adrian Paschke wrote on 28/05/2009 16:26:56:
> 
> We don?t have any recursion in forward-chaining PRD and define 
> condition satisfaction on the basis of a state of the fact base (a 
> Herbrand interpretation) which is a set of ground atomic formulas, 
> i.e. negated formulas are also ground as well as list formulas.

I understand that. But I do not understand how it relates to my questions? 
(Probably, I would not have to ask the questions if I understood why your 
reply relates to them :-)

Cheers,

Christian

ILOG, an IBM Company
9 rue de Verdun
94253 - Gentilly cedex - FRANCE
Tel. +33 1 49 08 35 00
Fax +33 1 49 08 35 10

Sauf indication contraire ci-dessus:/ Unless stated otherwise above:
Compagnie IBM France
Siège Social : Tour Descartes, 2, avenue Gambetta, La Défense 5, 92400 
Courbevoie
RCS Nanterre 552 118 465
Forme Sociale : S.A.S.
Capital Social : 609.751.783,30 ?
SIREN/SIRET : 552 118 465 02430
Received on Thursday, 28 May 2009 14:37:07 GMT

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