Abstract
We give a procedure for generalizing a proof of a concrete instance of a theorem by recovering inductions that have been expanded in the concrete proof. It consists of three operations introduction, extension and propagation, and by iterating these operations in a bottom-up fashion, it can reconstruct nested inductions. We discuss how to use EBG for identifying the induction formula, and how EBG must be modified so that nested inductions can be reconstructed.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bruynooghe,M., De Raedt,L., De Schreye,D.: Explanation based program transformation, Proceedings of IJCAI 89, 1989, pp.407–412.
Ellman,T.: Explanation-based learning: A survey of programs and perspectives, ACM Computing Surveys, Vol.21, No.2 (1989), pp.163–221.
Hagiya,M.: Programming by example and proving by example using higher-order unification, 10th International Conference on Automated Deduction (Stickel,M., ed.), Lecture Notes in Artificial Intelligence, Vol.449 (1990), pp.588–602.
Hagiya,M.: From programming-by-example to proving-by-example, Theoretical Aspects of Computer Software (Ito, T., Meyer,A.R., eds.), Lecture Notes in Computer Science, Vol.526 (1991), pp.387–419.
Shavlik,J.W., DeJong,G.F.: An explanation-based approach to generalizing number, Proceedings of IJCAI 87, 1987, pp.236–238.
Shavlik,J.W., DeJong,G.F.: Acquiring general iterative concepts by reformulating explanations of observed examples, Machine Learning Volume III (Kodratoff,Y., Michalski,R., eds.), 1990, pp.302–350.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagiya, M. (1993). An iterative and bottom-up procedure for proving-by-example. In: Brazdil, P.B. (eds) Machine Learning: ECML-93. ECML 1993. Lecture Notes in Computer Science, vol 667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56602-3_147
Download citation
DOI: https://doi.org/10.1007/3-540-56602-3_147
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56602-1
Online ISBN: 978-3-540-47597-2
eBook Packages: Springer Book Archive