AN APPROACH TO AUTOMATIC PROBLEM -SOLVING

Summary A digital computer program, the Graph Traverser (Doran & Michie 1966), can seek a solution to any problem which may be interpreted as that of finding a path from one specified node of a graph to another. Emphasis is placed Upon the evaluation of intermediate states of the problem (nodes of the graph) according to the extent to which they resemble the 'goal' state. Sample results from first applications of the program, and possible future developments, are discussed. The program is related to other problemsolving programs.

[1]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[2]  E. Feigenbaum,et al.  Computers and Thought , 1963 .

[3]  Daniel G. Bobrow,et al.  A question-answering system for high school algebra word problems , 1899, AFIPS '64 (Fall, part I).

[4]  Bertram Raphael,et al.  A computer program which "understands" , 1964, AFIPS '64 (Fall, part I).

[5]  A. Hormann.  GAKU: AN ARTIFICIAL STUDENT. , 1965, Behavioral science.

[6]  J. Doran,et al.  Experiments with the Graph Traverser program , 1966, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.