- From: Gerd Wagner <wagnerg@tu-cottbus.de>
- Date: Tue, 16 Jan 2007 17:56:24 +0100
- To: 'Hassan Aït-Kaci' <hak@ilog.com>
- Cc: "'W3C RIF WG'" <public-rif-wg@w3.org>
> Thanks for your comment on my paper: you must be the fastest reader > that I have come across in my life! ;-) In fact, I'm not a fast reader at all, of course, I just managed to browse through your paper. > Re. your comment, I must say thay I do not quite understand what it > has to do with either the topic of the article, nor what it means. > What I wrote about is simple: because CLP makes rules and constraints > orthogonal, it offers a way to use rules over arbitrary data models > - not just data and FOTs. I then focused on the OSF and DL formalisms > seen as constraint systems for objects and inheritance. The nature of > the rules is *not* important and may be of all kinds including Horn, > (with or without negations or all kinds), Production, YouNameIt, ... OK, but you don't discuss that in your paper, do you? > > How can you capture SQL, Prolog and production rules > > without supporting NaF? > > Again the focus of my paper is *NOT* on the rules but (as the title > states it clearly) about *data models as constraint systems*. > > Also, the nature of the paper is that of a (semi-formal) tutorial > - not an exhaustive survey about all known or possible ways to > conjugate rules and data. Perhaps you should write such an article? > :-) Come on, you are the expert here, not me! > This notwithstanding, the way negation is handled for OSF terms (see > Section 3.1.5) implicitly uses a CWA on the set of sort. I admit that > I should make this fact clear. ... > At any rate, I am sorry that you find my work of debatable interest > for your needs, and I apologize for disappointing your expectations. Your paper is clearly of high value as a publication, but for my purposes I'd prefer to see a more RIF-focused version of it. -Gerd
Received on Tuesday, 16 January 2007 16:56:32 UTC