A TRANSFORMATIONAL APPROACH TO NEGATION IN LOGIC PROGRAMMING

被引：36

作者：

BARBUTI, R ^{[1
]}

MANCARELLA, P ^{[1
]}

PEDRESCHI, D ^{[1
]}

TURINI, F ^{[1
]}

机构：

[1] UNIV PISA,DEPARTIMENTO INFORMAT,I-56100 PISA,ITALY

来源：

JOURNAL OF LOGIC PROGRAMMING | 1990年 / 8卷 / 03期

关键词：

D O I：

10.1016/0743-1066(90)90023-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A transformation technique is introduced which, given the Horn-clause definition of a set of predicates pi, synthesizes the definitions of new predicate p̃i which can be used, under a suitable refutation procedure, to compute the finite failure set of pi. This technique exhibits some computational advantages, such as the possibility of computing nonground negative goals still preserving the capability of producing answers. The refutation procedure, named SLDN refutation, is proved sound and complete with respect to the completed program. © 1990.

引用

页码：201 / 228

页数：28

共 27 条

[1] SYMBOLIC SEMANTICS AND PROGRAM REDUCTION [J].

AMBRIOLA, V ;

GIANNOTTI, F ;

PEDRESCHI, D ;

TURINI, F .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1985, 11 (08) :784-794

[2]

APT K, 1986, P WORKSHOP F DEDUCTI

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

APT, KR ;

VANEMDEN, MH .

JOURNAL OF THE ACM, 1982, 29 (03) :841-862

[4]

BACHA H, 1987, 4TH P INT C LOG PROG, P394

[5]

BARBUTI R, 1986, LECT NOTES COMPUT SC, V225, P600

[6]

BARBUTI R, 1987, LECT NOTES COMPUT SC, V250, P96

[7]

CAVEDON L, IN PRESS J LOGIC PRO

[8]

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

[9]

JAFFAR J, 1985, LOGIC PROGRAMMING RE

[10]

Jaffar J., 1986, CONSTRAINT LOGIC PRO

← 1 2 3 →