SOLVING SATISFIABILITY WITH LESS SEARCHING

被引：23

作者：

PURDOM, PW

机构：

来源：

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE | 1984年 / 6卷 / 04期

关键词：

D O I：

10.1109/TPAMI.1984.4767555

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：510 / 513

页数：4

共 15 条

[1] ON MATRICES WITH CONNECTIONS [J].

BIBEL, W .

JOURNAL OF THE ACM, 1981, 28 (04) :633-645

[2]

Bobrow D. G., 1974, Computing Surveys, V6, P153, DOI 10.1145/356631.356632

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

DAVIS, M ;

PUTNAM, H .

JOURNAL OF THE ACM, 1960, 7 (03) :201-215

[4] A MACHINE PROGRAM FOR THEOREM-PROVING [J].

DAVIS, M ;

LOGEMANN, G ;

LOVELAND, D .

COMMUNICATIONS OF THE ACM, 1962, 5 (07) :394-397

[5] A SUFFICIENT CONDITION FOR BACKTRACK-FREE SEARCH [J].

FREUDER, EC .

JOURNAL OF THE ACM, 1982, 29 (01) :24-32

[6]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[7]

GASCHNIG J, 1979, THESIS CARNEGIEMELLO

[8] CORRECTION [J].

GOLDBERG, A .

INFORMATION PROCESSING LETTERS, 1983, 16 (04) :213-213

[9] AVERAGE TIME ANALYSES OF SIMPLIFIED DAVIS-PUTNAM PROCEDURES [J].

GOLDBERG, A ;

PURDOM, P ;

BROWN, C .

INFORMATION PROCESSING LETTERS, 1982, 15 (02) :72-75

[10] INCREASING TREE-SEARCH EFFICIENCY FOR CONSTRAINT SATISFACTION PROBLEMS [J].

HARALICK, RM ;

ELLIOTT, GL .

ARTIFICIAL INTELLIGENCE, 1980, 14 (03) :263-313

← 1 2 →