SPLITTING AND REDUCTION HEURISTICS IN AUTOMATIC THEOREM PROVING

被引:37
作者
BLEDSOE, WW [1 ]
机构
[1] UNIV TEXAS,AUSTIN,TX
关键词
D O I
10.1016/0004-3702(71)90004-X
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
引用
收藏
页码:55 / 77
页数:23
相关论文
共 13 条
[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]  
ANDERSON R, 1970, SPR P JOINT C, P653
[3]  
ANDREWS PB, 1970, 7027 CARN MELL U DEP
[4]  
BLEDSOE WW, 1970, DESCRIPTION LISP FUN
[5]  
DARLINGTON JL, 1968, MACHINE INTELLIGENCE, V3
[6]  
ERNST G, 1970, UTILITY INDEPENDENT
[7]  
Halmos Paul R, 1960, NAIVE SET THEORY
[8]  
MORRIS JB, 1969, MAY P IJCAI WASH
[9]  
MORRIS JB, 1969, WORKING PAPER PROOFC
[10]  
MORSE AP, 1965, THEORY SETS