LOGIC PROGRAMMING AND NEGATION - A SURVEY

被引：185
作者：
APT, KR
BOL, RN
机构：
来源：
JOURNAL OF LOGIC PROGRAMMING | 1994年 / 20卷 / 1-3期
关键词：
D O I：
10.1016/0743-1066(94)90024-8
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the proof-theoretic and model-theoretic issues and the relationships between them.
引用
收藏
页码：9 / 71
页数：63
相关论文
共 162 条
[1]  
ALFERES JJ, 1992, P JOINT INT C S LOG, P574
[2]  
Apt K. R., 1991, New Generation Computing, V9, P335, DOI 10.1007/BF03037168
[3]  
Apt K. R., 1991, Fundamenta Informaticae, V14, P339
[4]  
Apt K. R., 1990, Fundamenta Informaticae, V13, P1
[5]  
Apt K.R., 1990, HDB THEORETICAL COMP, P493
[6]   CONTRIBUTIONS TO THE THEORY OF LOGIC PROGRAMMING [J].
APT, KR ;
VANEMDEN, MH .
JOURNAL OF THE ACM, 1982, 29 (03) :841-862
[7]   A NEW DEFINITION OF SLDNF-RESOLUTION [J].
APT, KR ;
DOETS, K .
JOURNAL OF LOGIC PROGRAMMING, 1994, 18 (02) :177-190
[8]   REASONING ABOUT TERMINATION OF PURE PROLOG PROGRAMS [J].
APT, KR ;
PEDRESCHI, D .
INFORMATION AND COMPUTATION, 1993, 106 (01) :109-157
[9]  
APT KR, IN PRESS ACM T PROGR
[10]  
APT KR, 1988, F DEDUCTIVE DATABASE, P193
12345678910