UNFOLD FOLD TRANSFORMATIONS AND LOOP OPTIMIZATION OF LOGIC PROGRAMS

被引:0
作者
DEBRAY, SK [1 ]
机构
[1] UNIV ARIZONA,DEPT COMP SCI,TUCSON,AZ 85721
来源
SIGPLAN NOTICES | 1988年 / 23卷 / 07期
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:297 / 307
页数:11
相关论文
共 50 条
[31]   Transformations of logic programs on infinite lists [J].
Pettorossi, Alberto ;
Senni, Valerio ;
Proietti, Maurizio .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2010, 10 :383-399
[32]   Loop checks for logic programs with functions [J].
Shen, YD ;
Yuan, LY ;
You, JH .
THEORETICAL COMPUTER SCIENCE, 2001, 266 (1-2) :441-461
[33]   Loop formulas for description logic programs [J].
Wang, Yisong ;
You, Jia-Huai ;
Yuan, Li Yan ;
Shen, Yi-Dong .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2010, 10 :531-545
[34]   Loop formulas for disjunctive logic programs [J].
Lee, J ;
Lifschitz, V .
LOGIC PROGRAMMING, PROCEEDINGS, 2003, 2916 :451-465
[35]   Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant [J].
Danvy, Olivier .
JOURNAL OF FUNCTIONAL PROGRAMMING, 2022, 32 (01)
[36]   Protein fold discovery using stochastic logic programs [J].
Chen, Jianzhong ;
Kelley, Lawrence ;
Muggleton, Stephen ;
Sternberg, Michael .
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2008, 4911 LNAI :244-262
[37]   Transformations of logic programs related to causality and planning [J].
Erdem, E ;
Lifschitz, V .
LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1999, 1730 :107-116
[38]   REDUNDANCY ELIMINATION AND LOOP CHECKS FOR LOGIC PROGRAMS [J].
FERRUCCI, F ;
PACINI, G ;
SESSA, MI .
INFORMATION AND COMPUTATION, 1995, 119 (02) :137-153
[39]   AN ANALYSIS OF LOOP CHECKING MECHANISMS FOR LOGIC PROGRAMS [J].
BOL, RN ;
APT, KR ;
KLOP, JW .
THEORETICAL COMPUTER SCIENCE, 1991, 86 (01) :35-79
[40]   Loop Formulas for Splitable Temporal Logic Programs [J].
Aguado, Felicidad ;
Cabalar, Pedro ;
Perez, Gilberto ;
Vidal, Concepcion .
LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 2011, 6645 :80-92