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

Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan

Abstract:
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.

Bibtex Entry:

@inproceedings{RKRR:ASIAN99,
author = {Abhik Roychoudhury and  K. Narayan Kumar and  C. R. Ramakrishnan and  I. V. Ramakrishnan},
title = {Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs},
booktitle = {Advances in Computing Science: Fifth Asian Computer Science Conference ({ASIAN})},
address = {Phuket, Thailand},
month = {December},
pages = {322--333},
series = {Lecture Notes in Computer Science},
volume = {1742},
publisher = {Springer},
year = {1999}
}

Full Paper: [pdf]

Home | Papers

C. R. Ramakrishnan
(cram@cs.sunysb.edu)