@inproceedings{9f60821f382f477bace3a1bf032e703a,
title = "Beyond Tamaki-Sato style unfold/fold transformations for normal logic programs",
abstract = "Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation sys- tems for normal logic programs allow only Tamaki-Sato style folding us- ing 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 recur- sion, 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.",
author = "Abhik Roychoudhury and \{Narayan Kumar\}, K. and Ramakrishnan, \{C. R.\} and Ramakrishnan, \{I. V.\}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 5th Asian Computing Science Conference on Advances in Computing Science, ASIAN 1999 ; Conference date: 10-12-1999 Through 12-12-1999",
year = "1999",
doi = "10.1007/3-540-46674-6\_27",
language = "English",
isbn = "354066856X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "322--333",
editor = "Roland Yap and P.S. Thiagarajan",
booktitle = "Advances in Computing Science - ASIAN 1999 - 5th Asian Computing Science Conference, Proceedings",
}