Combining Induction and Saturation-Based Theorem Proving

M. Echenim (1) , Nicolas Peltier (1)

1 LIG - Laboratoire d'Informatique de Grenoble

A method is devised to integrate reasoning by mathematical induction into saturation-based proof procedures based on Resolution or Superposition. The obtained calculi are capable of handling formulas in which some of the quantified variables range over inductively defined domains (which, as is well-known, cannot be expressed in first-order logic). The procedure is defined as a set of inference rules that generate inductive invariants incrementally and prove their validity. Although the considered logic itself is incomplete, it is shown that the invariant generation rules are complete, in the sense that if an invariant (of some specific form) is deducible from the considered clauses, then it is eventually generated.

Domaines: Logique en informatique [cs.LO]

M. Echenim, Nicolas Peltier. Combining Induction and Saturation-Based Theorem Proving. Journal of Automated Reasoning, 2020, 64 (2), pp.253-294. ⟨10.1007/s10817-019-09519-x⟩. ⟨hal-02990367⟩