Abstract
In the framework of Extended Prolog Execution [K&S 86] a rule of Structural Induction is presented. For the induction step the new rule takes advantage of a Prolog program synthesized through Proof-Extraction techniques, and rests on extensive use of Negation as Failure Inference for exploiting the information contained in the extracted program. A comparison is made between the new rule and the rules of Restricted Structural Induction [Fri 90] and Computation Induction [Cla 79], and we note that by an uncomplicated preprocessing of the goal formula and the program the new rule subsumes the two latter rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bouverot A., Extracting and Transforming Logic Programs. Technical Report LIENS-91–4, Laboratoire d’Informatique de l’Ecole Normale Supérieure, Paris, 1991.
Burstall R. M., Proving Properties of Programs by Structural Induction. Comput. J., vol. 12, February 1969, pp. 41–48.
Clark K. L., Negation As Failure. In Logic and Databases, H. Gallaire and J. Minker (Eds.), Plenum Press, New York, 1978, pp. 293–322.
Clark K. L., Predicate Logic as a Computational Formalism. Research Monograph 79/59, TOC, Imperial College, 1979.
Elkan C. and McAllester D., Automated Inductive Reasoning about Logic Programs. Proc. 5th Intl. Conf. and Symp. on Logic Programming, Seatle, 1988, pp. 876–892.
Fribourg L., Extracting Logic Programs from Proofs that use Extended Prolog Execution and Induction. Proc. 7th Intl. Conf. on Logic Programming, Jerusalem, 1990, pp. 685–699.
Fribourg L., Automatic Generation of Simplification Lemmas for Inductive Proofs. Proc. Intl. Symp. on Logic Programming, San Diego, 1991, pp. 103–116.
Kanamori T. and Seki H., Verification of Prolog Programs Using an Extension of Execution. In ( Shapiro E., ed.) 3rd International Conference on Logic Programming, Lecture Notes in Computer Science 225, 1986, pp. 475–489.
Manna Z. and Vuillemin J., Fixpoint Approach to the Theory of Computation. Commun. Ass. Comput. Mach., vol. 15, no. 7, 1972, pp. 528–536
Reynolds C. and Yeh R. T., Induction as the Basis for Program Verification. In IEEE Transactions on Software Enginering, vol. SE-2, no. 4, December 1976.
Rogers H.R., Theory of Recursive Functions and Effective Com-putability. N.Y., McGraw-Hill, th IEEE Symp. on Logic Programming, San Fransisco, 1967, pp. 215–223.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag London
About this chapter
Cite this chapter
Fribourg, L., Olsén, H. (1993). A Unifying View of Structural Induction and Computation Induction for Logic Programs. In: Lau, KK., Clement, T.P. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3560-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3560-9_4
Publisher Name: Springer, London
Print ISBN: 978-3-540-19806-2
Online ISBN: 978-1-4471-3560-9
eBook Packages: Springer Book Archive