PARTIAL DEDUCTION OF LOGIC PROGRAMS WRT WELL-FOUNDED SEMANTICS

被引:10
作者
ARAVINDAN, C
DUNG, PM
机构
[1] Computer Science Program, School of Advanced Technologies, Asian Institute of Technology, Bangkok, 10501
关键词
PARTIAL DEDUCTION; PROGRAM TRANSFORMATION; PROGRAM SPECIALIZATION; WELL-FOUNDED NEGATION;
D O I
10.1007/BF03038308
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we extend the partial deduction framework of Lloyd and Shepherdson, so that unfolding of non-ground negative literals and loop checks can be carried out during partial deduction. We show that the unified framework is sound and complete wrt well-founded model semantics, when certain conditions are satisfied.
引用
收藏
页码:45 / 74
页数:30
相关论文
共 34 条
[1]  
Apt Krzysztof R, 1988, FDN DEDUCTIVE DATABA, P89, DOI [10.1016/B978-0-934613-40-8.50006-3, DOI 10.1016/B978-0-934613-40-8.50006-3]
[2]   A TRANSFORMATIONAL APPROACH TO NEGATION IN LOGIC PROGRAMMING [J].
BARBUTI, R ;
MANCARELLA, P ;
PEDRESCHI, D ;
TURINI, F .
JOURNAL OF LOGIC PROGRAMMING, 1990, 8 (03) :201-228
[3]  
BENKERIMI K, 1990, 1990 P N AM C LOG PR, P343
[4]   LOOP CHECKING IN PARTIAL DEDUCTION [J].
BOL, R .
JOURNAL OF LOGIC PROGRAMMING, 1993, 16 (1-2) :25-46
[5]  
BOL RN, 1991, THEOR COMPUT SCI, V86, P35, DOI 10.1016/0304-3975(91)90004-L
[6]   LOOP CHECKING AND NEGATION [J].
BOL, RN .
JOURNAL OF LOGIC PROGRAMMING, 1993, 15 (1-2) :147-175
[7]  
CHAN D, 1988, 5TH P INTL C S LOG P, P111
[8]  
CHAN D, 1989, 1989 P N AM C LOG PR, V1, P477
[9]  
CHAN D, 1988, METAPROGRAMMING LOGI, P299
[10]  
Clark K. L., 1978, Logic and data bases, P293