THE INTRACTABILITY OF RESOLUTION

被引：449

作者：

HAKEN, A

机构：

来源：

关键词：

D O I：

10.1016/0304-3975(85)90144-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：297 / 308

页数：12

共 9 条

[1]

BARR A, 1983, HDB ARTIFICIAL INTEL, V3, pCH7

[2] RELATIVE EFFICIENCY OF PROPOSITIONAL PROOF SYSTEMS [J].

COOK, SA ;

RECKHOW, RA .

[3]

COOK SA, 1974, ACM SIGACT NEWS, V6, P15

[4] A COMPUTING PROCEDURE FOR QUANTIFICATION THEORY [J].

DAVIS, M ;

PUTNAM, H .

[5]

Galil Z., 1977, Theoretical Computer Science, V4, P23, DOI 10.1016/0304-3975(77)90054-8

[6]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[7] A NOTE ON REGULAR RESOLUTION [J].

JUSTEN, K .

[8] A MACHINE-ORIENTED LOGIC BASED ON RESOLUTION PRINCIPLE [J].

ROBINSON, JA .

[9]

Tseytin G. S., 1970, STUDIES CONSTRUCTI 2, P115