UNIFYING VIEW OF SOME LINEAR HERBRAND PROCEDURES

被引:15
作者
LOVELAND, DW
机构
关键词
D O I
10.1145/321694.321706
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:366 / &
相关论文
共 21 条
[1]   A LINEAR FORMAT FOR RESOLUTION WITH MERGING AND A NEW TECHNIQUE FOR ESTABLISHING COMPLETENESS [J].
ANDERSON, R ;
BLEDSOE, WW .
JOURNAL OF THE ACM, 1970, 17 (03) :525-&
[2]   UNIT PROOF AND INPUT PROOF IN THEOREM PROVING [J].
CHANG, CL .
JOURNAL OF THE ACM, 1970, 17 (04) :698-&
[3]   A COMPUTING PROCEDURE FOR QUANTIFICATION THEORY [J].
DAVIS, M ;
PUTNAM, H .
JOURNAL OF THE ACM, 1960, 7 (03) :201-215
[4]  
Davis M., 1963, P S APPL MATH, P15
[5]  
HAYES P, 1969, MACHINE INTELLIGENCE, V4, P87
[6]  
KOWALSKI R, 1970, 34 ED U MET UN MEM
[7]   A SIMPLIFIED FORMAT FOR MODEL ELIMINATION THEOREM-PROVING PROCEDURE [J].
LOVELAND, DW .
JOURNAL OF THE ACM, 1969, 16 (03) :349-&
[8]   MECHANICAL THEOREM-PROVING BY MODEL ELIMINATION [J].
LOVELAND, DW .
JOURNAL OF THE ACM, 1968, 15 (02) :236-&
[9]  
LOVELAND DW, 1971, COMPUTER SCIENCE RES, P7
[10]  
LOVELAND DW, 1970, SOME LINEAR HERBRAND