Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

Re: Choosing a data structure for AI applications

by John M. Dlugosz (Monsignor)
on Jul 16, 2002 at 17:38 UTC ( #182175=note: print w/replies, xml ) Need Help??

in reply to Choosing a data structure for AI applications

My impression when you talked about a fully-populated hash was of a lazy hash made using a tie, instead.

I think book vs. book(learning_perl) is fundimental. A fact is not a simple symbol, but a nested structure that is to be matched, possibly with a pattern. Furthermore, this is the identical structure as a rule such as gives.

Have you looked at CLIPS? It's been decades since I read the manual, but forgetting the forward-vs-backward chaining issues, I'm thinking that the way it represents knowledge and gets this into a C program would be worth looking at. It's easier to build up ad-hoc data structures in Perl...

I think that knowledge representation is key. It doesn't matter whether it's persisted and how, but simply decide how everything is hooked up, to represent arbitrary rules and attributed facts and variables.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://182175]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (5)
As of 2018-01-19 09:42 GMT
Find Nodes?
    Voting Booth?
    How did you see in the new year?

    Results (216 votes). Check out past polls.