An unfold/fold transformation framework for definite logic programs

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

doi:10.1145/982158.982160

An unfold/fold transformation framework for definite logic programs

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

Computer Science

National University of Singapore
SPIC Science Foundation

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

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.

Original language	English
Pages (from-to)	464-509
Number of pages	46
Journal	ACM Transactions on Programming Languages and Systems
Volume	26
Issue number	3
DOIs	https://doi.org/10.1145/982158.982160
State	Published - May 2004

Keywords

Folding
Inductive theorem proving
Logic programming
Program transformation
Unfolding

Access to Document

10.1145/982158.982160

Cite this

@article{7b36118c85144db6a21ca45e4196ff78,

title = "An unfold/fold transformation framework for definite logic programs",

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.",

keywords = "Folding, Inductive theorem proving, Logic programming, Program transformation, Unfolding",

author = "Abhik Roychoudhury and Kumar, \{K. Narayan\} and Ramakrishnan, \{C. R.\} and Ramakrishnan, \{I. V.\}",

year = "2004",

month = may,

doi = "10.1145/982158.982160",

language = "English",

volume = "26",

pages = "464--509",

journal = "ACM Transactions on Programming Languages and Systems",

issn = "0164-0925",

number = "3",

}

TY - JOUR

T1 - An unfold/fold transformation framework for definite logic programs

AU - Roychoudhury, Abhik

AU - Kumar, K. Narayan

AU - Ramakrishnan, C. R.

AU - Ramakrishnan, I. V.

PY - 2004/5

Y1 - 2004/5

N2 - 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.

AB - 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.

KW - Folding

KW - Inductive theorem proving

KW - Logic programming

KW - Program transformation

KW - Unfolding

UR - https://www.scopus.com/pages/publications/4444258176

U2 - 10.1145/982158.982160

DO - 10.1145/982158.982160

M3 - Article

AN - SCOPUS:4444258176

SN - 0164-0925

VL - 26

SP - 464

EP - 509

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

IS - 3

ER -

An unfold/fold transformation framework for definite logic programs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this