SPLITTING AND REDUCTION HEURISTICS IN AUTOMATIC THEOREM PROVING

[1] A LINEAR FORMAT FOR RESOLUTION WITH MERGING AND A NEW TECHNIQUE FOR ESTABLISHING COMPLETENESS [J]. 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

[1] A LINEAR FORMAT FOR RESOLUTION WITH MERGING AND A NEW TECHNIQUE FOR ESTABLISHING COMPLETENESS [J]. 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