A SIMPLIFIED PROBLEM REDUCTION FORMAT

[1] [Anonymous], SYMBOLIC LOGIC MECHA

[2] SPLITTING AND REDUCTION HEURISTICS IN AUTOMATIC THEOREM PROVING [J]. ARTIFICIAL INTELLIGENCE, 1971, 2 (01) : 55 - 77

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

[4] Brand D., 1975, SIAM Journal on Computing, V4, P412, DOI 10.1137/0204036

[5] GENTZEN G, 1934, COLLECTED PAPERS G G, P68

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

[7] Loveland D.W., 1978, AUTOMATED THEOREM PR, DOI DOI 10.1016/0378-4754(80)90081-6

[8] MANNA Z, 1974, MATH THEORY COMPUTAT

[9] HUMAN ORIENTED LOGIC FOR AUTOMATIC THEOREM-PROVING [J]. JOURNAL OF THE ACM, 1974, 21 (04) : 606 - 621

[10] THEOREM-PROVING WITH ABSTRACTION [J]. ARTIFICIAL INTELLIGENCE, 1981, 16 (01) : 47 - 108

[1] [Anonymous], SYMBOLIC LOGIC MECHA

[2] SPLITTING AND REDUCTION HEURISTICS IN AUTOMATIC THEOREM PROVING [J]. ARTIFICIAL INTELLIGENCE, 1971, 2 (01) : 55 - 77

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

[4] Brand D., 1975, SIAM Journal on Computing, V4, P412, DOI 10.1137/0204036

[5] GENTZEN G, 1934, COLLECTED PAPERS G G, P68

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

[7] Loveland D.W., 1978, AUTOMATED THEOREM PR, DOI DOI 10.1016/0378-4754(80)90081-6

[8] MANNA Z, 1974, MATH THEORY COMPUTAT

[9] HUMAN ORIENTED LOGIC FOR AUTOMATIC THEOREM-PROVING [J]. JOURNAL OF THE ACM, 1974, 21 (04) : 606 - 621

[10] THEOREM-PROVING WITH ABSTRACTION [J]. ARTIFICIAL INTELLIGENCE, 1981, 16 (01) : 47 - 108