Abstract
Given formula F and axioms, theorem proving methods try to prove F. If F is provable, the proof obtained provides an explanation of the fact that F is a theorem. It may happen that F is FALSE or, for some reason, that we fail to prove F. Several theorem proving methods provide different kinds of the so-called "failure formulae". The failure formulae explain why the proof of F failed.
This paper illustrates the kind of failure formulae generated by the methodology we have developed for inductive theorem proving of theorems containing existential quantifiers. We reveal the importance of the failure formula vocabulary for generating of the so called missing lemmas.
The paper uses the vocabulary presented in [7].
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
W. Bibel, K. M. Hoernig: LOPS — A System Based on a Strategical Approach to Program Synthesis; in [2], 69–91.
A. Biermann, G. Guiho, Y. Kodratoff (ed): Automatic Program Construction Techniques; Macmillan Publishing Company, London, 1984.
S. Biundo: A synthesis system mechanizing proofs by induction; in: ECAI' 86 Proceedings, Vol. 1, 1986, 69–78.
R. S. Boyer, J S. Moore: A Computational Logic; Academic Press, 1979.
N. Dershowitz: Synthesis by Completion; in [9], 208–214.
M. Franova: Fundamentals for a new methodology for inductive theorem proving: CM-construction of atomic formulae; in [12], 137–141.
M. Franova: Fundamentals of a new methodology for Program Synthesis from Formal Specifications: CM-construction of atomic formulae; Thesis, Université Paris-Sud, November, Orsay, France, 1988.
M. Franova: Precomas 0.3 User Guide; Rapport de Recherche No.524, L.R.I., Université de Paris-Sud, Orsay, France, October, 1989.
A. K. Joshi, (ed): Proceedings of the Ninth International Joint Conference on Artificial Intelligence; August, Los Angeles, 1985.
Y. Kodratoff, M.Picard: Complétion de systèmes de réécriture et synthèse de programmes à partir de leurs spécifications; Bigre No.35, October, 1983.
Y. Kodratoff: An Introduction to Machine Learning; Pitman, London, 1988.
Y. Kodratoff: Proceedings of the 8th European Conference on Artificial Intelligence; August 1–5, Pitman, London, United Kingdom, 1988.
Z. Manna, R. Waldinger: A Deductive Approach to Program Synthesis; ACM Transactions on Programming Languages and Systems, Vol. 2., No.1, January, 1980, 90–121.
R. Michalski, J. G. Carbonell, T. M. Mitchell (eds): Machine Learning: An Artificial Intelligence Approach; Tioga, Palo Alto, California, 1983.
T. M. Mitchell: Learning by experimentation, acquiring and refining problem-solving heuristics; in [14], 163–190.
H. Perdrix: Program synthesis from specifications; ESPRIT'85, Status Report of Continuing Work, North-Holland, 1986, 371–385.
D. R. Smith: Top-Down Synthesis of Simple Divide and Conquer Algorithm; Artificial Intelligence, vol. 27, no. 1, 1985, 43–96.
M. Franova: Explanations in inductive theorem proving; to appear in Proceedings of the AAAI 90 Workshop on Learning.
G. DeJong, R. Mooney: Explanation-Based Learning: An Alternative View; Machine Learning 1, 1986, 145–176.
K. L. Clark, J. Darlington: Algorithm classification through synthesis; The Computer Journal, Vol. 23, No 1, 61–65.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fraňová, M. (1990). Constructive matching — Explanation based methodology for inductive theorem proving. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_36
Download citation
DOI: https://doi.org/10.1007/3-540-53414-8_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53414-3
Online ISBN: 978-3-540-46869-1
eBook Packages: Springer Book Archive