Conjecture synthesis for inductive theories

M Johansson, L Dixon, A Bundy - Journal of automated reasoning, 2011 - Springer
Journal of automated reasoning, 2011Springer
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 …
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果