THEOREM-PROVING WITH ABSTRACTION

[1] [Anonymous], SYMBOLIC LOGIC MECHA

[2] NON-RESOLUTION THEOREM PROVING [J]. ARTIFICIAL INTELLIGENCE, 1977, 9 (01) : 1 - 35

[3] Boyer R.S., 1971, THESIS U TEXAS AUSTI

[4] UNIT REFUTATIONS AND HORN SETS [J]. JOURNAL OF THE ACM, 1974, 21 (04) : 590 - 605

[5] PARADIGM FOR REASONING BY ANALOGY [J]. ARTIFICIAL INTELLIGENCE, 1971, 2 (02) : 147 - 178

[6] MUNYER JC, 1979, USE ANALOGY DEDUCTIV

[7] REBOH R, 1972, 75 STANF RES I ART I

[8] ROBINSON JA, 1965, INT J COMPUT MATH, V1, P227

[9] PLANNING IN A HIERARCHY OF ABSTRACTION SPACES [J]. ARTIFICIAL INTELLIGENCE, 1974, 5 (02) : 115 - 135

[10] AUTOMATIC THEOREM PROVING WITH RENAMABLE AND SEMANTIC RESOLUTION [J]. JOURNAL OF THE ACM, 1967, 14 (04) : 687 - &

[1] [Anonymous], SYMBOLIC LOGIC MECHA

[2] NON-RESOLUTION THEOREM PROVING [J]. ARTIFICIAL INTELLIGENCE, 1977, 9 (01) : 1 - 35

[3] Boyer R.S., 1971, THESIS U TEXAS AUSTI

[4] UNIT REFUTATIONS AND HORN SETS [J]. JOURNAL OF THE ACM, 1974, 21 (04) : 590 - 605

[5] PARADIGM FOR REASONING BY ANALOGY [J]. ARTIFICIAL INTELLIGENCE, 1971, 2 (02) : 147 - 178

[6] MUNYER JC, 1979, USE ANALOGY DEDUCTIV

[7] REBOH R, 1972, 75 STANF RES I ART I

[8] ROBINSON JA, 1965, INT J COMPUT MATH, V1, P227

[9] PLANNING IN A HIERARCHY OF ABSTRACTION SPACES [J]. ARTIFICIAL INTELLIGENCE, 1974, 5 (02) : 115 - 135

[10] AUTOMATIC THEOREM PROVING WITH RENAMABLE AND SEMANTIC RESOLUTION [J]. JOURNAL OF THE ACM, 1967, 14 (04) : 687 - &