Proving Theorems by Folding/Unfolding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Proving Theorems by Folding/Unfolding

Moussa Demba
  • Function : Author
  • PersonId : 835395
Khaled Bsaïes
  • Function : Author
Francis Alexandre
  • Function : Author
  • PersonId : 830098


Proofs techniques can be seen as simplification methods, i.e. formulas are transformed into trivial ones, true. Unfortunately, we are sometimes faced with an unprovable formula because no induction hypothesis can be applied. In this paper, we propose a method that can allows us to apply induction hypothesis.
No file

Dates and versions

inria-00100204 , version 1 (26-09-2006)


  • HAL Id : inria-00100204 , version 1


Moussa Demba, Khaled Bsaïes, Francis Alexandre. Proving Theorems by Folding/Unfolding. 2nd International Conference : Sciences of Electronic, Technologies of Information and Telecommunications - SETIT 2004, Mar 2004, Sousse, Tunisie, 6 p. ⟨inria-00100204⟩
58 View
0 Download


Gmail Facebook Twitter LinkedIn More