|
Edinburgh Research Archive >
Informatics, School of >
Informatics Publications >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1842/4746
|
| Title: | Conjecture Synthesis for Inductive Theories |
| Authors: | Johansson, Moa Dixon, Lucas Bundy, Alan |
| Issue Date: | 2010 |
| Journal Title: | Journal of Automated Reasoning |
| Publisher: | SpringerLink |
| Abstract: | We have developed a program for inductive theory formation, called IsaCoSy, which synthesises conjectures ‘bottom-up’ from the available constants and free variables. The synthesis process is made tractable by only generating irreducible terms, which are then filtered through counter-example checking and passed to the automatic inductive prover IsaPlanner. The main technical contribution is the presentation of a constraint mechanism for synthesis. As theorems are discovered, this generates additional constraints on the synthesis process. We evaluate IsaCoSy as a tool for automatically generating the background theories one would expect in a mature proof assistant, such as the Isabelle system. The results show that IsaCoSy produces most, and sometimes all, of the theorems in the Isabelle libraries. The number of additional un-interesting theorems are small enough to be easily pruned by hand. |
| Keywords: | Theory formation Induction Synthesis Theorem proving Lemma discovery |
| URI: | http://www.springerlink.com/content/bk711q2u247mr967/ http://hdl.handle.net/1842/4746 |
| ISSN: | 0168-7433 |
| Appears in Collections: | Informatics Publications
|
Items in ERA are protected by copyright, with all rights reserved, unless otherwise indicated.
|