EXTENDING SLD RESOLUTION TO EQUATIONAL HORN CLAUSES USING E-UNIFICATION

被引：18

作者：

GALLIER, JH ^{[1
]}

RAATZ, S ^{[1
]}

机构：

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

来源：

JOURNAL OF LOGIC PROGRAMMING | 1989年 / 6卷 / 1-2期

关键词：

D O I：

10.1016/0743-1066(89)90028-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：3 / 43

页数：41

共 55 条

[1]

ANDERSON R, 1970, 1970 P AFIPS SPR JOI, V36, P653

[2]

[Anonymous], 1986, LOGIC COMPUTER SCI F

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

APT, KR ;

VANEMDEN, MH .

[4]

BARBUTTI R, 1985, FUNCTIONAL LOGIC PRO

[5]

BELLIA M, 1982, LOGIC PROGRAMMING

[6]

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

[7]

DERSHOWITZ N, 1985 IEEE S LOG PROG, P54

Dowling, William F. ;

Gallier, Jean H. .

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

[9] VARIATIONS ON THE COMMON SUBEXPRESSION PROBLEM [J].

DOWNEY, PJ ;

SETHI, R ;

TARJAN, RE .

[10]

FAGES F, 1984, CADE7 P NAP, P194