Emmanuel Kounalis

Learn More
Proofs by induction are important in many computer science and artiicial intelligence applications , in particular, in program veriication and speciication systems. We present a new method to prove (and disprove) automatically inductive properties. Given a set of axioms, a well-suited induction scheme is constructed automatically. We call such an induction(More)
Several induction provers have been developed to automate inductive proofs (see for instance: Nqthm, RRL INKA, LP, SPIKE, CLAM-Oyster, ...). However, inductive theorem provers very often fail to terminate. A proof to go through requires either additional lemmas, a generalization, a suitable induction variable to induce upon , or a case split. The aim of(More)