Implicit induction in conditional theories

Abstract : We propose a new procedure for proof by induction in conditional theories where case analysis is simulated by term rewriting. This technique reduces considerably the number ofvariables of a conjecture to be considered for applying induction schemes (inductive positions). Our procedure is presented as a set of inference rules whose correctness has been formally proved. Moreover, when the axioms are ground convergent it is possible to apply the system for refuting conjectures. The procedure is even refutationally complete for conditional equations with boolean preconditions over free constructors (under the same hypotheses). The method is entirely implemented in the prover SPIKE. This system has proved interesting examples in a completely automatic way, that is, without interaction with the user and without ad-hoc heuristics. It has also proved the challenging Gilbreath card trick, with only 2 easy lemmas.
Type de document :
Rapport
[Research Report] RR-2045, INRIA. 1993
Liste complète des métadonnées

https://hal.inria.fr/inria-00074627
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:56:26
Dernière modification le : samedi 17 septembre 2016 - 01:06:53
Document(s) archivé(s) le : mardi 12 avril 2011 - 17:53:24

Fichiers

Identifiants

  • HAL Id : inria-00074627, version 1

Collections

Citation

Adel Bouhoula, Michaël Rusinowitch. Implicit induction in conditional theories. [Research Report] RR-2045, INRIA. 1993. 〈inria-00074627〉

Partager

Métriques

Consultations de la notice

119

Téléchargements de fichiers

72