Neo wrote:
>>Prolog also uses linked lists which can be nested. In addition, you can place structures in the list, and the structures can contain atoms and lists and "lists of lists" and "lists of lists and atoms," etc. There is no 'program.' The system is an ordered database of assertions. You start the logic engine by asking a question. The engine attempts to answer the question using the information in the database, matching as it goes, using a depth-first tree search. The underlying math is predicate calculus and horn clauses. Primitives in the language allow you to assert data into the database, thus modifying the 'program'. This allows the system to learn.
>
> .
> the focus of the experimental db is to provide the most flexible
> method of representing things. I believe I have already surpassed RM.
Idiot. Complexity of structure is not a worthy or useful goal in data
management.
Received on Sun Apr 16 2006 - 11:25:50 CDT
