UNFOLD FOLD TRANSFORMATION OF STRATIFIED PROGRAMS

被引：47

作者：

SEKI, H ^{[1
]}

机构：

[1] INST NEW GENERAT COMP TECHNOL,TOKYO,JAPAN

来源：

THEORETICAL COMPUTER SCIENCE | 1991年 / 86卷 / 01期

关键词：

D O I：

10.1016/0304-3975(91)90007-O

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper describes some extensions of Tamaki-Sato's (1984) unfold/fold transformation of definite programs. We first propose unfold/fold rules also preserving the finite failure set (by SLD-resolution) of a definite program, which the original rules proposed by Tamaki and Sato do not. Then, we show that our unfold/fold rules can be extended to rules for stratified programs and prove that both the success set and the finite failure set (by SLDNF-resolution) of a stratified program are preserved. Preservation of equivalence of the perfect model semantics (Przymusinski (1988)) is also discussed.

引用

页码：107 / 139

页数：33

共 20 条

[1] Apt K., 1987, FDN DEDUCTIVE DATABA, P89
[2] CAVEDON L, 1987, CS8706 U WALK COMP S
[3] Clark K. L., 1978, Logic and data bases, P293
[4] GARDNER PA, UNPUB UNFOLD FOLD TR
[5] Jaffar J, 1983, P INT JOINT C ART IN, P500
[6] KANAMORI T, 1987, 4TH P INT C LOG PROG, P744
[7] KAWAMURA T, 1988, PRESERVATION STRONGE
[8] KAWAMURA T, FGCS88
[9] CLOSURES AND FAIRNESS IN THE SEMANTICS OF PROGRAMMING LOGIC
LASSEZ, JL
MAHER, MJ
[J]. THEORETICAL COMPUTER SCIENCE, 1984, 29 (1-2) : 167 - 184
[10] AN EFFICIENT UNIFICATION ALGORITHM
MARTELLI, A
MONTANARI, U
[J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (02): : 258 - 282

← 1 2 →