MATINGS IN MATRICES

被引：43

作者：

BIBEL, W

机构：

来源：

关键词：

D O I：

10.1145/182.183

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：844 / 852

页数：9

共 21 条

[1] THEOREM-PROVING VIA GENERAL MATINGS [J].

ANDREWS, PB .

[2]

[Anonymous], SYMBOLIC LOGIC MECHA

[3] ON MATRICES WITH CONNECTIONS [J].

BIBEL, W .

[4] SYNTAX-DIRECTED, SEMANTICS-SUPPORTED PROGRAM SYNTHESIS [J].

BIBEL, W .

[5] A COMPARATIVE-STUDY OF SEVERAL PROOF PROCEDURES [J].

BIBEL, W .

[6]

Bibel W., 1982, AUTOMATED THEOREM PR

[7] NON-RESOLUTION THEOREM PROVING [J].

BLEDSOE, WW .

[8] Studies on logical closing. [J].

Gentzen, G .

[9]

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

[10]

Nilsson N.J., 1980, PRINCIPLES ARTIFICIA