Re: Storing data and code in a Db with LISP-like interface

"Bob Badour" <bbadour_at_pei.sympatico.ca> wrote in message news:mub2g.63837$VV4.1194075_at_ursa-nb00s0.nbnet.nb.ca...
> JOG wrote:
>
> > Bob Badour wrote:
> >
> >>JOG wrote:
> >>
> >>
> >>>Bob Badour wrote:
> >>>
> >>>
> >>>>JOG wrote:
> >>>>
> >>>>
> >>>>>Bob Badour wrote:
> >>>>>
> >>>>>
> >>>>>>Alvin Ryder wrote:

> >>
> >>The point is the relational model basically supports both with the one
> >>small requirement that one must specify one's universe. I do not
> >>understand what you mean by 'has to remember this predicate'.
> >
> > I don't agree, but we may be talking at cross purposes - let me explain
> > with a trivial example. Take the relation: { (clothing:coat,
> > weather:sunny), (clothing:sunglasses, weather:raining) }
> >
> > I am storing propositions of the nature that if Frank, say, is not
> > wearing a coat it is sunny, and if he's is not wearing sunglasses then
> > it must be raining (Frank's a bit of a fashion victim). The predicate
> > behind the relation is: [¬clothing -> weather], and anyone interacting
> > with the db must be aware of this in order to reform my original
> > propositions, and so draw appropriate conclusions.
> >
> > In prolog, however I can state this explicitly and another user will
> > not require any external knowledge of the relationship:
> >
> > weather(sunny) :- /+ clothing(coat)
> > weather(rainy) :- /+ clothing(sunglasses)
> >
> > And there my limited knowledge of logical programming is exhausted.

> Okay, I think I see what you mean. Thank you for explaining it to me.

What about constraints ?
What about derived relations ?
What about count() ?
What about normalization ?
What about bussiness rules ?
What about data mining ? Received on Fri Apr 28 2006 - 10:33:47 CEST