Paper: Automata-driven automated induction (at LICS 1997)

Authors: Adel Bouhoula Jean-Pierre Jouannaud

Abstract

This work investigates inductive theorem proving techniques for first-order functions whose meaning and domains can be specified by Horn Clauses built up from the equality and finitely many unary membership predicates. In contrast with other works in the area, constructors are not assumed to be free. Techniques originating from tree automata are used to describe ground constructor terms in normal form, on which the induction proofs are built up. Validity of (free) constructor clauses is checked by on original technique relying on the recent discovery of a complete axiomatisation of finite trees and their rational subsets. Validity of clauses with defined symbols or non-free constructor terms is reduced to the latter case by appropriate inference rules using a notion of ground reducibility for these symbols. We show how to check this property by generating proof obligations which can be passed over to the inductive prover.

BibTeX

  @InProceedings{BouhoulaJouannaud-Automatadrivenautom,
    author = 	 {Adel Bouhoula and Jean-Pierre Jouannaud},
    title = 	 {Automata-driven automated induction},
    booktitle =  {Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS 1997)},
    year =	 {1997},
    month =	 {June}, 
    pages =      {14--25},
    location =   {Warsaw, Poland}, 
    publisher =	 {IEEE Computer Society Press}
  }