Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
复制标题
超越 Tamaki-Sato 风格的普通逻辑程序的展开/折叠转换
DOI：
10.1142/s0129054102001175
复制
发表时间：
1999
影响因子：
0.8
通讯作者：
I. Ramakrishnan
中科院分区：
文献类型：
--
作者：
Abhik Roychoudhury;K. Kumar;C. Ramakrishnan;I. Ramakrishnan
展开/折叠转换系统的逻辑程序已被广泛研究。用于正常逻辑程序的现有展开/折叠变换系统仅允许使用来自变换序列中的先前程序的子句的Tamaki-Sato风格折叠：即，它们使用单个非递归子句进行折叠。在本文中，我们提出了一个转换系统，允许折叠存在的递归，析取，以及否定。我们表明，转换是正确的各种语义的否定，包括良好的基础模型和稳定的模型语义。
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sato style folding using clauses from a previous program in the transformation sequence: i.e., they fold using a single, non-recursive clause. In this paper we present a transformation system that permits folding in the presence of recursion, disjunction, as well as negation. We show that the transformations are correct with respect to various semantics of negation including the well-founded model and stable model semantics.