Explanation Based Program Transformation
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Automated Deduction. Pages 407-411.
Abstract
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programming, we present a technique where the folding is driven by an example. The transformation is aimed at programs suffering from inefficiencies due to the repetition of identical subcomputations. The execution of an example is analysed to locate repeated subcomputations. Then the structure of the example is used to control a fold-unfoldtransformation of the program. The transformation can be automated. The method can be regarded as an extension of explanation based learning.
@inproceedings{ijcai1989p65,
title = {Explanation Based Program Transformation},
author = {Bruynooghe, Maurice and de Raedt, Luc and De Schreye, Danny},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {407--411},
year = {1989},
month = {8},
note = {Automated Deduction},
url = {https://ijcai.org/proceedings/1989/65},
}
TY - CPAPER TI - Explanation Based Program Transformation AU - Bruynooghe, Maurice AU - de Raedt, Luc AU - De Schreye, Danny T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 407 EP - 411 UR - https://ijcai.org/proceedings/1989/65 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
