Automating inductionless induction using test sets

  • Authors:

  • Deepak Kapur;Paliath Narendran;Hantao Zhang

  • Affiliations:

  • Department of Computer Science, State University of New York at Albany, Albany, NY 12222, USA;Department of Computer Science, State University of New York at Albany, Albany, NY 12222, USA;Department of Computer Science, The University of Iowa, Iowa City, IA 52242, USA

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

The inductionless induction (also called proof by consistency) approach for proving equations by induction from an equational theory, requires a consistency check for equational theories. A new method using test sets for checking consistency of an equational theory is proposed. Using this method, a variation of the Knuth-Bendix completion procedure can be used for automatically proving equations by induction. The method does not suffer from limitations imposed by the methods proposed by Musser as well as by Huet and Hullot, and is as powerful as Jouannaud and Kounalis' method based on ground-reducibility. A theoretical comparison of the test set method with Jouannaud and Kounalis' method is given showing that the test set method is generally much better. Both the methods have been implemented in RRL, Rewrite Rule Laboratory, a theorem proving environment based on rewriting techniques and completion. In practice also, the test set method is faster than Jouannaud and Kounalis' method. The test set construction can also be used to check for the sufficient-completeness property of equational axiomatizations including algebraic specifications of abstract data types as well as for identifying constructors in an algebraic specification.