UNIT REFUTATIONS AND HORN SETS

被引：83

作者：

HENSCHEN, L

WOS, L

机构：

[1] ARGONNE NATL LAB,ARGONNE,IL 60439

[2] NORTHWESTERN UNIV,COMP SCI DEPT,EVANSTON,IL 60201

来源：

关键词：

D O I：

10.1145/321850.321857

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：590 / 605

页数：16

共 18 条

[1]

ALLEN JR, 1970, MACH INTELL, V5, P321

[2]

[Anonymous], P AFIPS

[3]

[Anonymous], 1969, MACHINE INTELLIGENCE

[4] UNIT PROOF AND INPUT PROOF IN THEOREM PROVING [J].

CHANG, CL .

[5] COMPLETENESS OF LINEAR REFUTATION FOR THEORIES WITH EQUALITY [J].

CHANG, CL ;

SLAGLE, JR .

[6] THEOREM PROVING WITH VARIABLE-CONSTRAINED RESOLUTION [J].

CHANG, CL .

[7]

HERMES H, 1965, ENUMERABILITY DECIDA

[8]

Horn A., 1951, The Journal of Symbolic Logic, P14, DOI DOI 10.2307/2268661

[9]

LUCKHAM D, 1970, P IRIA S AUT DEM, P00163

MELTZER, B .