A Programming Language With Automatic Goal Generation and Selection
Arthur J. Nevins · Journal of the ACM · 1970
A computer program is described that serves in the dual capacity of being a modified programming language as well as a general problem-solving program with a heuristic search procedure which efficiently selects the seemingly best avenue to explore next.Among the preliminary experiments conducted with the program was the demonstration of its ability not only to prove all theorems in the propositional calculus found in Russell and Whitehead's Principia Mathematica, but to do so in a manner similar to the proofs found in that work.