Scheme-based synthesis of inductive theories

10Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Montano-Rivas, O., McCasland, R., Dixon, L., & Bundy, A. (2010). Scheme-based synthesis of inductive theories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6437 LNAI, pp. 348–361). https://doi.org/10.1007/978-3-642-16761-4_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free