Please use this identifier to cite or link to this item:
|Title:||An unfold/fold transformation framework for definite logic programs||Authors:||Roychoudhury, A.
Inductive theorem proving
|Issue Date:||2004||Citation:||Roychoudhury, A., Kumar, K.N., Ramakrishnan, C.R., Ramakrishnan, I.V. (2004). An unfold/fold transformation framework for definite logic programs. ACM Transactions on Programming Languages and Systems 26 (3) : 464-509. ScholarBank@NUS Repository. https://doi.org/10.1145/982158.982160||Abstract:||An unfold/fold transformation framework for definite logic programs is presented. Unfold/fold transformations have been widely used for improving program efficiency and for reasoning about programs. Existing unfold/fold transformations for logic programs restrict the application of folding by placing conditions that are sufficient to guarantee the correctness of folding. The proposed framework places no syntactic restriction on the application of folding and it can be used to derive transformation systems. A new transformation system, SCOUT is derived as an instance of the framework and its power relative to the existing transformation systems.||Source Title:||ACM Transactions on Programming Languages and Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/39162||ISSN:||01640925||DOI:||10.1145/982158.982160|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 12, 2019
WEB OF SCIENCETM
checked on Sep 5, 2019
checked on Sep 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.