Martin, Jonthan C. and King, Andy
Generating Efficient, Terminating Logic Programs.
In: Bidoit, Michel and Dauchet, Max, eds.
Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development.
Lecture Notes in Computer Science, 1214
Springer Verlag, pp. 173-184.
ISBN 3-540-62781-2 .
(Full text available)
The objective of control generation in logic programming is to automatically derive a computation rule for a program that is efficient and yet does not compromise program correctness. Progress in solving this important problem has been slow and, to date, only partial solutions have been proposed where the generated programs are either incorrect or inefficient. We show how the control generation problem can be tackled with a simple automatic transformation that relies on information about the depths of derivations. To prove correctness of our transform we introduce the notion of a semi delay recurrent program which generalises previous ideas in the termination literature for reasoning about logic programs with dynamic selection rules.
- Depositors only (login required):