Extending Decision Procedures with Induction Schemes ,
Proc.7th International Conf. on Automated Deduction (CADE)
Springer LNAI 1831, June 2000, Pittsburgh, 324-345
Families of function definitions and conjectures based in quantifier-free decidable theories are identified for which inductive validity of conjectures can be decided by the {\it cover set} method, a heuristic implemented in a rewrite-based induction theorem prover {\it Rewrite Rule Laboratory} ({\it RRL}) for mechanizing induction. Conditions characterizing definitions and conjectures are syntactic, and can be easily checked, thus making it possible to determine a priori whether a given conjecture can be decided. The concept of a {\it $\TT$-based} function definition is introduced that consists of a finite set of terminating complete rewrite rules of the form $f(s_1, \cdots, s_m) \rew r$, where $s_1, \cdots, s_m$ are interpreted terms from a decidable theory $\TT$, and $r$ is either an interpreted term or has non-nested recursive calls to $f$ with all other function symbols from $\TT$. Two kinds of conjectures are considered. {\it Simple} conjectures are of the form $f(x_1, \cdots x_m) = t$, where $f$ is $\TT$-based, $x_i$'s are distinct variables, and $t$ is interpreted in $\TT$. {\it Complex} conjectures differ from simple conjectures in their left sides which may contain many function symbols whose definitions are $\TT$-based and the nested order in which these function symbols appear in the left sides have the {\it compatibility property} with their definitions.
The main objective is to ensure that for each induction subgoal generated from a conjecture after selecting an induction scheme, the resulting formula can be simplified so that induction hypothesis(es), whenever needed, is applicable, and the result of this application is a formula in $\TT$. Decidable theories considered are the quantifier-free theory of Presburger arithmetic, congruence closure on ground terms (with or without associative-commutative operators), propositional calculus, and the quantifier-free theory of constructors (mostly, free constructors as in the case of finite lists and finite sequences). A byproduct of the approach is that it can predict the structure of intermediate lemmas needed for automatically deciding this subclass of conjectures. Several examples over lists, numbers and of properties involved in establishing the number-theoretic correctness of arithmetic circuits are given.