Skip to Main content Skip to Navigation
Reports

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.
Complete list of metadatas

https://hal.inria.fr/inria-00074627
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 3:56:26 PM
Last modification on : Wednesday, January 8, 2020 - 2:16:59 PM
Document(s) archivé(s) le : Tuesday, April 12, 2011 - 5:53:24 PM

Identifiers

  • 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⟩

Share

Metrics

Record views

160

Files downloads

203