Automated mathematical induction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Automated mathematical induction

Adel Bouhoula
  • Function : Author
  • PersonId : 756484
  • IdRef : 132449021
Emmanuel Kounalis
  • Function : Author


Proofs by induction are important in many computer science and artifical intelligence applications, in particular, in program verification and specification systems. We present a new method to prove (and disprove) automatically inductives properties. Given a set of axioms, a well-suited induction scheme is constructed automatically. We call such and induction scheme a test set. Then, for proving a property, we just instantiate it with terms from the test set and apply pure algebraic simplifications to the result. This method needs no completion and explicit induction. However it retains their positive features, namely, the completeness of the former and the robustness of the latter. It has been implemented in the theorem-prover SPIKE.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1663.pdf (1.94 Mo) Télécharger le fichier

Dates and versions

inria-00074894 , version 1 (24-05-2006)


  • HAL Id : inria-00074894 , version 1


Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch. Automated mathematical induction. [Research Report] RR-1663, INRIA. 1992. ⟨inria-00074894⟩
61 View
235 Download


Gmail Facebook Twitter LinkedIn More