A NEW DEFINITION OF SLDNF-RESOLUTION

被引：23

作者：

APT, KR ^{[1
]}

DOETS, K ^{[1
]}

机构：

[1] UNIV AMSTERDAM,FAC MATH & COMP SCI,1018 TV AMSTERDAM,NETHERLANDS

来源：

JOURNAL OF LOGIC PROGRAMMING | 1994年 / 18卷 / 02期

关键词：

D O I：

10.1016/0743-1066(94)90051-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We propose a new, ''top-down'' definition of SLDNF-resolution that retains the spirit of the original definition, but avoids the difficulties noted in the literature. We compare it with the ''bottom-up'' definition of Kunen [7].

引用

页码：177 / 190

页数：14

共 12 条

[1]

Apt K. R., 1991, New Generation Computing, V9, P335, DOI 10.1007/BF03037168

[2]

APT KR, 1991, LECT NOTES COMPUT SC, V526, P265

[3]

CHAN D, 1988, 5TH P INTL C S LOG P, P111

[4]

CLARK KL, 1979, DOC7959 IMP COLL DEP

[5]

DOETS HC, 1993, IN PRESS J LOGIC COM

[6] SIGNED DATA DEPENDENCIES IN LOGIC PROGRAMS [J].

KUNEN, K .

JOURNAL OF LOGIC PROGRAMMING, 1989, 7 (03) :231-245

[7] A NEW SLDNF-TREE [J].

MARTELLI, M ;

TRICOMI, C .

INFORMATION PROCESSING LETTERS, 1992, 43 (02) :57-62

[8]

Shepherdson J. C., 1984, Journal of Logic Programming, V1, P51, DOI 10.1016/0743-1066(84)90023-2

[9] A SOUND AND COMPLETE SEMANTICS FOR A VERSION OF NEGATION AS FAILURE [J].

SHEPHERDSON, JC .

THEORETICAL COMPUTER SCIENCE, 1989, 65 (03) :343-371

[10]

F LOGIC PROGRAMMING

← 1 2 →