Proceedings

How to Facilitate the Proof of Theorems by Using the Induction-matching, and by Generalization

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Theorem Proving. Pages 1208-1212.

© 1985 International Joint Conferences on Artificial Intelligence

Abstract

In this paper, we show how we conceive the proof of theorems by sructural induction. Our aim is to facilitate the proof of the theorems which can Iead, in a context of automatic theorem proving, to very lengthy ( or even impossible) proofs. We use a very simple tool, the i-matching or inductionmatching, which allows us, on the one hand to deftne an original procedure of generalization, and on the other hand tu deftne an original way of generating Iemmas .

  1. Aubln R. : "Mechanlzlng structurallnduction ". Ph.D ; thesls. Univ. Edlnburgh (1976) .
  2. Boyer R.S and Moore J S. : "A computatlonal loglc ". Academlc Press (1980) .
  3. Burstall R. : "Proving propretles of program by struc- turallnductlon" . Computer J. 12 ( 1) ( 1969) p 41 -48.
  4. Kodratoti Y. and Castaing J. : "Trivializlng the proof of trivial theorems ". IJCAI (1983) . Kaisruhe West Germany . Proceedings of the eight international joint conference on Artlficial lntelllgence p 930.
  5. Huet G. and Hutlot J-M. : "Proofs by induction in Equa- tlonal theorles wlth constructors" . 21th IEEE Symposium on Foundatlons of computer Science (1980) .
  6. Wegbreit B. : "Goal directed program transformation ".IEEE Trans . Softw. Eng. SE -2,2 (j 71) p 69-80 .
  7. Manna, et al. : "lnductive methods for proving proper- tles of programs ". CACM, vol16, no 8, (1973).
  8. Abdali, et al. : "Generallzatlon heurlstics for theorems Related to recurslvely Defined Functions ". Proc . 4th Na- tional Conf. on Artlficial lntelligence, Austin, ( 1984) .

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards