Sciweavers

Share
ASIAN
1999
Springer

Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs

8 years 11 months ago
Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
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.
Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakr
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where ASIAN
Authors Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan
Comments (0)
books