| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Storing data and code in a Db with LISP-like interface
Neo wrote:
> ... I assert that dbd's methodology is
> the most general/systematic/flexible. I do not assert it is the
> fastest, smallest, most user friendly, least resource hungry, most
> popular, etc.
I have no desire to disprove your assertion that "dbd's methodology is the most general/systematic/flexible." - I don't even understand it.
I do appreciate that you are going your own stubborn way to create a system that has the qualities you want it to have. You have been accused of re-inventing just about everybodies favourite toy/tool. To me that means you must be doing /something/ right.
Some of those qualities - as I understood them -
reminded me of prolog. You downloaded it, and
played with it. I hope you get some
refinement of/reflection on your ideas from that.
OTOH I would also appreciate it if you would stop making false assertions as to what other systems can't do.
Nick Malik wrote:
>>If you expect intelligent people to hold a discourse with you, >>you have to treat us with enough respect to back away from rampant >>superiority to think about the question.
You might read it as just: Please be specific when stating what you want to know. See below
>>You have assumed that it is valid to create a relationship between >>two things and to want to know what that relationship is. >>I have SHOWN you how Prolog would do this, >>by identifying the relationship as one of the items in the tuple.
You had demos of dbd's previous incarnation at a site, but it seems down.
>>Prolog and Lisp are knowledge representation systems. >>Relational databases are primarily data representation systems, >>but if you look at the schema, you can quite frequently ascertain >>the business rules that existed at the time of design. >>Perhaps this is a bad place to code business rules. >>Perhaps not. I think that there are arguments both ways. >>Regardless, knowledge is represented both in the form of facts and >>in the form, in the case of Lisp and Prolog, in deductions.
>>Therefore it is absolutely incumbent upon you to explain >>why you would want to choose a knowledge representation >>that does not collect a bit of information and then assert >>that the mining of that information is so fundamental to >>the requirements as to be beneath you to explain it.
You have created vocabulary of your own - it isn't allways easy to see what needs some translation. I can't read your mind and I did not read all your previous posts. It helps if you are specific about the information needs.
I took some of your statements rather literal to bitplumb the following:
-----------neorel.pro
thing(john). % John is a thing to represent.
thing(mary). % Mary is a thing to represent.
thing(like). % Like is a thing to represent.
thing(relationship(john, like, mary)).
% The relationship "john like mary"
% is a thing to represent.
?- thing(relationship(john, Relator_Verb, mary)).
Relator_Verb = like ;
No
One of the questions you (dissappointingly) skipped was:
(Neo)
>>> Enter the following relationships in prolog: >>> class (john, person). meaning one of john's class is person >>> instance (person, john). meaning one of person's instance is john >>
![]() |
![]() |