Scheme-Based Synthesis of Inductive Theories

  • Omar Montano-Rivas
  • Roy McCasland
  • Lucas Dixon
  • Alan Bundy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6437)

Abstract

We describe an approach to automatically invent/explore new mathematical theories, with the goal of producing results comparable to those produced by humans, as represented, for example, in the libraries of the Isabelle proof assistant. Our approach is based on ‘schemes’, which are terms in higher-order logic. We show that it is possible to automate the instantiation process of schemes to generate conjectures and definitions. We also show how the new definitions and the lemmata discovered during the exploration of the theory can be used not only to help with the proof obligations during the exploration, but also to reduce redundancies inherent in most theory formation systems. We implemented our ideas in an automated tool, called IsaScheme, which employs Knuth-Bendix completion and recent automatic inductive proof tools. We have evaluated our system in a theory of natural numbers and a theory of lists.

Keywords

Mathematical theory exploration schemes theorem proving term rewriting termination 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Omar Montano-Rivas
    • 1
  • Roy McCasland
    • 1
  • Lucas Dixon
    • 1
  • Alan Bundy
    • 1
  1. 1.School of InformaticsUniversity of EdinburghUK

Personalised recommendations