AUTOMATIC THEOREM PROVING WITH RENAMABLE AND SEMANTIC RESOLUTION

被引：93

作者：

SLAGLE, JR

机构：

来源：

关键词：

D O I：

10.1145/321420.321428

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：687 / &

共 25 条

[1] A COMPUTING PROCEDURE FOR QUANTIFICATION THEORY [J].

DAVIS, M ;

PUTNAM, H .

[2]

DAVIS M, 1963, 1962 P S MATH THEOR, P15

[3]

Feigenbaum E., 1963, COMPUTERS THOUGHT ED, P134

[4]

FEIGENBAUM E, 1963, COMPUTERS THOUGHT ED

[5]

GELERNTER H, 1960 P WEST JOINT CO, V17, P143

[6]

GELERNTER H, 1963, COMPUT THOUGHT, P153

[7]

Gelernter H, 1959, P INT C INFORMATION, P273

[8]

Gelerntner Herbert, 1963, COMPUT THOUGHT, P134

[9]

GILMORE PC, 1959, P INT C INFORMATION

[10]

MCCARTHY J, 1959, P CONF MECHANIZATION