|
Edinburgh Research Archive >
Informatics, School of >
Informatics thesis and dissertation collection >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1842/6269
|
| Title: | Scheme-based theorem discovery and concept invention |
| Authors: | Montano-Rivas, Omar |
| Supervisor(s): | McCasland, Roy Bundy, Alan Dixon, Lucas |
| Issue Date: | 25-Jun-2012 |
| Publisher: | The University of Edinburgh |
| Abstract: | In this thesis 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 formulae 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 a 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 exploit associative-commutative (AC) operators using
ordered rewriting to avoid AC variations of the same instantiation. 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: | schemes theory exploration theorem proving term rewriting termination completion |
| URI: | http://hdl.handle.net/1842/6269 |
| Appears in Collections: | Informatics thesis and dissertation collection
|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.
|