Mechanizing inductive reasoning.
Emmanuel Kounalis, Michaël Rusinowitch · Bulletin of the European Association for Theoretical Computer Science · 1990
Automating proofs by induction is 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 constructed automatically. We call such a scheme a test-set. Then, for proving a property, we just instanciate it with terms from the test-set and apply pure algebraic simplification to the result. This method avoids completion and explicit induction. However it retains their positive features, namely the completeness of the former and the robustness of the latter.