A Unified View of Induction Reasoning for First-Order Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

A Unified View of Induction Reasoning for First-Order Logic

Abstract

Induction is a powerful proof technique adapted to reason on sets with an unbounded number of elements. In a first-order setting, two different methods are distinguished: the conventional induction, based on explicit induction schemas, and the implicit induction, based on reductive procedures. We propose a new cycle-based induction method that keeps their best features, i.e., performs local and non-reductive reasoning, and naturally fits for mutual and lazy induction. The heart of the method is a proof strategy that identifies in the proof script the subset of formulas contributing to validate the application of induction hypotheses. The conventional and implicit induction are particular cases of our method.
Fichier principal
Vignette du fichier
document-poster.pdf (627.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00763236 , version 1 (10-12-2012)

Identifiers

  • HAL Id : hal-00763236 , version 1

Cite

Sorin Stratulat. A Unified View of Induction Reasoning for First-Order Logic. Turing-100, The Alan Turing Centenary Conference, Jun 2012, Manchester, United Kingdom. ⟨hal-00763236⟩
180 View
959 Download

Share

Gmail Facebook X LinkedIn More