Please use this identifier to cite or link to this item:
|Title:||Beyond tamaki-sato style unfold/fold transformations for normal logic programs||Authors:||Roychoudhury, A.
Narayan Kumar, K.
Normal Logic Programs
|Issue Date:||2002||Citation:||Roychoudhury, A.,Narayan Kumar, K.,Ramakrishnan, C.R.,Ramakrishnan, I.V. (2002). Beyond tamaki-sato style unfold/fold transformations for normal logic programs. International Journal of Foundations of Computer Science 13 (3) : 387-403. ScholarBank@NUS Repository. https://doi.org/10.1142/S0129054102001175||Abstract:||Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs typically fold using a single, non-recursive clause i.e. the folding transformation is very restricted. 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 model theoretic semantics of normal logic programs including the well-founded model and stable model semantics. © 2002 World Scientific Publishing Company.||Source Title:||International Journal of Foundations of Computer Science||URI:||http://scholarbank.nus.edu.sg/handle/10635/78043||ISSN:||01290541||DOI:||10.1142/S0129054102001175|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 19, 2019
checked on Aug 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.