SUFFICIENT CONDITIONS FOR SUCCESS OF GPS

被引:10
作者
ERNST, GW
机构
[1] Case Western Reserve University, Computer Engineering Division, Cleveland, Ohio
关键词
D O I
10.1145/321541.321542
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A formal model of a problem is developed and its relationship to the General Problem Solver (GPS) is discussed. Before GPS can work on a problem it must be given differences, a difference-ordering, and a table of connections, in addition to the specifications of a problem. Formal definitions of this additional information are given, and sufficient conditions for the success of GPS are derived. These conditions point out the utility of differences and a difference-ordering that yield a 舠triangular舡 table of connections. Several different formulations of the Tower of Hanoi are given to illustrate the formal concepts. The use of subproblems in narrowing search is discussed. © 1969, ACM. All rights reserved.
引用
收藏
页码:517 / &
相关论文
共 9 条
[1]  
AMAREL S, 1967, SYSTEMS COMPUTER SCI
[2]  
BANERJI RB, THEORY PROBLEM SOLVI
[3]  
CHURCH A, 1936, J SYMBOL LOGIC, V1
[4]  
Ernst G, 1969, GPS CASE STUDY GEN P
[5]  
ERNST GW, 1967, SPR P AFIPS, V30, P583
[6]  
NEWELL A, 1960, SELF ORGANIZING SYST
[7]  
NEWELL A, 1965, 1965 P IFIP C
[8]  
NEWELL A, 1966, COMPUTER SCIENCE RES
[9]   A MACHINE-ORIENTED LOGIC BASED ON RESOLUTION PRINCIPLE [J].
ROBINSON, JA .
JOURNAL OF THE ACM, 1965, 12 (01) :23-&