On the transformation of logic programs with instantiation based computation rules

Authors:
Danny de Schreye;Maurice Bruynooghe
Affiliations:
Department of Computer Science, Katholieke Universiteit Leuven Celestijnenlaan 200A, 3030 Heverlee, Belgium;Department of Computer Science, Katholieke Universiteit Leuven Celestijnenlaan 200A, 3030 Heverlee, Belgium
Venue:
Journal of Symbolic Computation
Year:
1989

Citing 7
Cited 1

Automating control for logic programs

Journal of Logic Programming
The concept of a supercompiler

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Unification revisited

Foundations of deductive databases and logic programming
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Derivation of Logic Programs

Journal of the ACM (JACM)
Algorithm = logic + control

Communications of the ACM
Prolog control rules

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2

Explanation based program transformation

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a formal description of a new transformation technique for declarative Horn clause programs. Our method allows the compilation of control information. We introduce the notion of an instantiation-based computation rule and present an algorithm to transform a given pair (@?, q), consisting of a Horn clause program P and a query pattern q for @?, into a new program @?"n"e"u, which, for the given query pattern, will behave in the same way, under the standard computation rule of Prolog, as the original program @? behaves under a specified instantiation-based computation rule. We prove the soundness and completeness of the method and discuss its relation to existing techniques for the specification of control rules and the transformation of logic programs.