Abstract
I discuss issues of control and floundering during execution of automatically synthesised logic programs. The process of program synthesis can be restricted, without loss of generality, so that the only negated calls appearing in a program are unifications, as in [10]. If called nonground, these predicates are delayed in a logic programming language with a flexible execution rule. [10] presents proposals for automatically delaying calls to predicates until they are instantiated appropriately. This can be implemented easily and safely in my synthesis approach, using meta-level knowledge about inductive proof. This technique is more general, more reliable and less laborious than the original.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Bruynooghe, D. de Schreye, and B. Krekels. Compiling control. Journal of Logic Programming, pages 135–162, 1989.
A. Bundy, A. Smaill, and J. Hesketh. Turning eureka steps into calculations in automatic program synthesis. In S.L.H. Clarke, editor, Proceedings of UK IT 90, pages 221-6, 1990. Also available from Edinburgh as DAI Research Paper 448.
A. Bundy, A. Smaill, and G. A. Wiggins. The synthesis of logic programs from inductive proofs. In J. Lloyd, editor, Computational Logic, pages 135–149. Springer-Verlag, 1990. Esprit Basic Research Series. Also available from Edinburgh as DAI Research Paper 501.
A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Research Paper 567, Dept. of Artificial Intelligence, Edinburgh, 1991. To appear in Artificial Intelligence.
A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 7:303–324, 1991. Earlier version available from Edinburgh as DAI Research Paper No 413.
R.L. Constable. Programs as proofs. Technical Report TR 82-532, Dept. of Computer Science, Cornell University, November 1982.
P. Hill and J. Lloyd. The Gödel Report. Technical Report TR-91-02, Department of Computer Science, University of Bristol, March 1991. Revised March 1992.
P. Madden. Automated Program Transformation Through Proof Transformation. PhD thesis, University of Edinburgh, 1991.
Per Martin-Löf. Intuitionistic Type Theory. Bibliopolis, Naples, 1984. Notes by Giovanni Sambin of a series of lectures given in Padua, June 1980.
L. Naish. Negation and control in Prolog, volume 238 of Lecture notes in Computer Science. Springer Verlag, 1986.
G. A. Wiggins. The improvement of prolog program efficiency by compiling control: A proof-theoretic view. In Proceedings of the Second International Workshop on Meta-programming in Logic, Leuven, Belgium, April 1990. Also available from Edinburgh as DAI Research Paper No. 455.
G. A. Wiggins. Synthesis and transformation of logic programs in the Whelk proof development system. In K. R. Apt, editor, Proceedings of JICSLP-92, 1992.
G. A. Wiggins, A. Bundy, H. C. Kraan, and J. Hesketh. Synthesis and transformation of logic programs through constructive, inductive proof. In K-K. Lau and T. Clement, editors, Proceedings of LoPSTr-91, pages 27–45. Springer Verlag, 1991. Workshops in Computing Series.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiggins, G.A. (1992). Negation and control in automatically generated logic programs. In: Pettorossi, A. (eds) Meta-Programming in Logic. META 1992. Lecture Notes in Computer Science, vol 649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56282-6_17
Download citation
DOI: https://doi.org/10.1007/3-540-56282-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56282-5
Online ISBN: 978-3-540-47505-7
eBook Packages: Springer Book Archive