Sunday, May 04, 2008

Came across something very interesting while studying for my AI exam, in "Artificial Intelligence" by Elaine Rich, Kevin Knight. What follows is an excerpt...

There are many heuristics that, although they are not as general as the nearest neighbor heuristic, are nevertheless useful in a wide variety of domains. For example, consider the task of discovering intersting ideas in some specified area. The following heuristic [Lenat, 1983b] is often useful:
"If there is an interesting function of two arguments f(x,y), look at what happens if the two arguments are identical."

In the domain of mathematics, this heuristic leads to the discovery of squaring if f is the multiplication function, and it leads to the discovery of an identity function if f is the function of set union. In less formal domains, this same heuristic leads to the disvoery of introspection if f is the function 'contemplate' or it leads to the notion of suicide if f is the function 'kill'.

No comments: