Automated mathematical induction

Adel Bouhoula 1 E. Kounalis Michaël Rusinowitch
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Proofs by induction are important in many computer science and artificial intelligence applications, in particular, in program verification and specification systems. We present a new method to prove (and disprove) automatically inductive properties. Given a set of axioms, a well-suited induction scheme is construted automatically. We call such an induction scheme a test set. Then, for proving a property, we just instantiate it with terms from the test set and apply pure algebraic simplification 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.
Type de document :
[Research Report] RR-2187, INRIA. 1994, pp.42
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:24:34
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58
Document(s) archivé(s) le : mardi 12 avril 2011 - 17:08:41



  • HAL Id : inria-00074484, version 1



Adel Bouhoula, E. Kounalis, Michaël Rusinowitch. Automated mathematical induction. [Research Report] RR-2187, INRIA. 1994, pp.42. 〈inria-00074484〉



Consultations de la notice


Téléchargements de fichiers