Journal of Automated Reasoning

, Volume 47, Issue 3, pp 251–289 | Cite as

Conjecture Synthesis for Inductive Theories

Article

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berghofer, S., Nipkow, T.: Random testing in Isabelle/HOL. In: SEFM ’04: Proceedings of the Software Engineering and Formal Methods, Second International Conference, Washington, DC, USA, pp. 230–239. IEEE Computer Society (2004)Google Scholar
  2. 2.
    Buchberger, B., Craciun, A., Jebelean, T., Kovacs, L., Kutsia, T., Nakagawa, K., Piroi, F., Popov, N., Robu, J., Rosenkrantz, M., Windsteiger, W.: Theorema: towards computer-aided mathematical theory exploration. Journal of Applied Logic 4(4), 470–504 (2006)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Bundy, A.: The use of explicit plans to guide inductive proofs. In: 9th International Conference on Automated Deduction, pp. 111–120 (1988)Google Scholar
  4. 4.
    Bundy, A., Basin, D., Hutter, D., Ireland, A.: Rippling: Meta-level Guidance for Mathematical Reasoning. Cambridge University Press (2005)Google Scholar
  5. 5.
    Bundy, A., van Harmelen, F., Hesketh, J., Smaill, A.: Experiments with proof plans for induction. J. Autom. Reason. 7(3), 303–324 (1992)CrossRefGoogle Scholar
  6. 6.
    Colton, S.: Automated Theory Formation in Pure Mathematics. Springer (2002)Google Scholar
  7. 7.
    Dershowitz, N.: Orderings for term-rewriting systems. In: 20th Annual Symposium on Foundations of Computer Science, pp. 123–131 (1979)Google Scholar
  8. 8.
    Dixon, L.: A Proof Planning Framework for Isabelle. PhD thesis, University of Edinburgh (2005)Google Scholar
  9. 9.
    Dixon, L., Fleuriot, J.: IsaPlanner: a prototype proof planner in Isabelle. In: Proceedings of CADE’03, pp. 279–283 (2003)Google Scholar
  10. 10.
    Dixon, L., Fleuriot, J.: Higher-order rippling in IsaPlanner. In: Proceedings of TPHOLs’04, pp. 83–98 (2004)Google Scholar
  11. 11.
    Gordon, M.J., Milner, A.J., Wadsworth, C.P.: Edinburgh LCF—A Mechanised Logic of Computation. Lecture Notes in Computer Science, vol. 78. Springer (1979)Google Scholar
  12. 12.
    Hodorog, M., Craciun, A.: Scheme-based systematic exploration of natural numbers. In: Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 26–34 (2006)Google Scholar
  13. 13.
    Johansson, M., Dixon, L., Bundy, A.: Properties of IsaCoSy’s Constraint Generation Algorithm. University of Edinburgh Technical Report from 2010 with number EDI-INF-RR-1378. Available online: http://dream.inf.ed.ac.uk/projects/lemmadiscovery/publications/IsaCoSyProperties.pdf (2010)
  14. 14.
    Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Computational Problems in Abstract Algebra (1967)Google Scholar
  15. 15.
    Lenat, D.B.: AM: discovery in mathematics as heuristic search. In: Heiberg, D., Damstra, D.A. (eds.) Knoledge-based Systems in Artificial Intelligence, Chapter 1. McGraw-Hill (1982)Google Scholar
  16. 16.
    Maclean, E., Ireland, A., Atkey, R., Dixon, L.: Refinement and term synthesis in loop invariant generation. In: WING 09: Workshop on Invariant Generation (2009)Google Scholar
  17. 17.
    McCasland, R., Bundy, A.: MATHsAiD: a mathematical theorem discovery tool. In: Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 17–22. IEEE Computer Society Press (2006)Google Scholar
  18. 18.
    McCasland, R., Bundy, A., Autexier, S.: Automated discovery of inductive theorems. Special Issue of Studies in Logic, Grammar and Rhetoric on Computer Reconstruction of the Body of Mathematics: From Insight to Proof: Festschrift in Honor of A. Trybulec 10(23), 135–149 (2007)Google Scholar
  19. 19.
    Monroy-Borja, R.: The Use of Abduction to Correct Faulty Conjectures. Master’s thesis, University of Edinburgh (1993)Google Scholar
  20. 20.
    Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL—A Proof Assistant for Higher-order Logic. Lecture Notes in Computer Science, vol. 2283. Springer (2002)Google Scholar
  21. 21.
    Paulson, L.C.: Isabelle: the next seven hundred theorem provers. In: 9th International Conference on Automated Deduction. LNCS, vol. 310, pp. 772–773. Springer (1988)Google Scholar
  22. 22.
    Puzis, Y., Gao, Y., Sutcliffe, G.: Automated generation of interesting theorems. In: Proceedings of the 19th International FLAIRS Conference, pp. 49–54 (2006)Google Scholar
  23. 23.
    Sutcliffe, G., Suttner, C.B.: The TPTP problem library: CNF release v1.2.1. J. Autom. Reason. 21(2), 177–203 (1998)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  1. 1.Dipartimento di InformaticaUniversità degli Studi di VeronaVeronaItaly
  2. 2.School of InformaticsUniversity of EdinburghEdinburghUK

Personalised recommendations