HORNLOG - A GRAPH-BASED INTERPRETER FOR GENERAL HORN CLAUSES

被引：6

作者：

GALLIER, JH ^{[1
]}

RAATZ, S ^{[1
]}

机构：

[1] UNIV PENN,DEPT COMP & INFORMAT SCI,PHILADELPHIA,PA 19104

来源：

JOURNAL OF LOGIC PROGRAMMING | 1987年 / 4卷 / 02期

关键词：

D O I：

10.1016/0743-1066(87)90015-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：119 / 155

页数：37

共 27 条

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

ANDREWS, PB .

[2]

[Anonymous], 1986, LOGIC COMPUTER SCI F

[3] CONTRIBUTIONS TO THE THEORY OF LOGIC PROGRAMMING [J].

APT, KR ;

VANEMDEN, MH .

[4]

APT KR, 1985, THEORY DECLARATIVE K

[5]

CHANG CC, 1978, MODEL THEORY

[6] USING REWRITING RULES FOR CONNECTION GRAPHS TO PROVE THEOREMS [J].

CHANG, CL ;

SLAGLE, JR .

[7]

Clark K. L., 1978, Logic and data bases, P293

[8]

CONNERY J, P C FUNCTIONAL PROGR, V1, P163

Dowling, William F. ;

Gallier, Jean H. .

Journal of Logic Programming, 1984, 1 (03) :267-284

[10]

FAY M, 1979, 4TH P WORKSH AUT DED