Generating Efficient, Terminating Logic Programs

Martin, J.M. and King, A.M. (1997) Generating Efficient, Terminating Logic Programs. In: 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 .

Postscript
Download (136Kb)	Preview
PDF
Download (215Kb)	Preview

Abstract

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.

Item Type:	Conference or workshop item (Paper)
Uncontrolled keywords:	Termination, Control Generation, Abstract Interpretation
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	25 Jul 2009 23:06
Last Modified:	06 Sep 2011 03:57
Resource URI:	http://kar.kent.ac.uk/id/eprint/21517 (The current URI for this page, for reference purposes)

• Depositors only (login required):