Scheme-Based Synthesis of Inductive Theories
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.
KeywordsMathematical theory exploration schemes theorem proving term rewriting termination
Unable to display preview. Download preview PDF.
- 1.Berghofer, S., Nipkow, T.: Random Testing in Isabelle/HOL. In: SEFM, pp. 230–239 (2004)Google Scholar
- 5.Colton, S.: Automated Theory Formation in Pure Mathematics. PhD thesis, Division of Informatics, University of Edinburgh (2001)Google Scholar
- 6.Craciun, A., Hodorog, M.: Decompositions of Natural Numbers: From A Case Study in Mathematical Theory Exploration. In: SYNASC 2007 (2007)Google Scholar
- 10.Johansson, M., Dixon, L., Bundy, A.: Conjecture Synthesis for Inductive Theories. Journal of Automated Reasoning (2010) (to appear)Google Scholar
- 11.Krauss, A.: Automating Recursive Definitions and Termination Proofs in Higher-Order Logic. PhD thesis, Dept. of Informatics, T. U. München (2009)Google Scholar
- 12.Lenat, D.B.: AM: An Artificial Intelligence approach to discovery in Mathematics as Heuristic Search. In: Knowledge-Based Systems in Artificial Intelligence (1982)Google Scholar
- 14.Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle’s Logics: HOL (2000)Google Scholar
- 16.Sutcliffe, G., Gao, Y., Colton, S.: A Grand Challenge of Theorem Discovery (June 2003)Google Scholar
- 17.Wehrman, I., Stump, A., Westbrook, E.: Slothrop: KnuthBendix Completion with a Modern Termination Checker. In: Webster University, St. Louis, Missouri M.Sc. Computer Science, Washington University, pp. 268–279 (2006)Google Scholar