Advertisement

Managing Automatically Formed Mathematical Theories

  • Simon Colton
  • Pedro Torres
  • Paul Cairns
  • Volker Sorge
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4108)

Abstract

The HR system forms scientific theories, and has found particularly successful application in domains of pure mathematics. Starting with only the axioms of an algebraic system, HR can generate dozens of example algebras, hundreds of concepts and thousands of conjectures, many of which have first order proofs. Given the overwhelming amount of knowledge produced, we have provided HR with sophisticated tools for handling this data. We present here the first full description of these management tools. Moreover, we describe how careful analysis of the theories produced by HR – which is enabled by the management tools – has led us to make interesting discoveries in algebraic domains. We demonstrate this with some illustrative results from HR’s theories about an algebra of one axiom. The results fueled further developments, and led us to discover and prove a fundamental theorem about this domain.

Keywords

Theory Formation Left Identity Horn Clause Java Code Construction History 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anderson, M.: A critical evaluation of Lenat’s AM program. Technical Report TR 89-09-19, Department of Computer Science, University of Washington (1989)Google Scholar
  2. 2.
    Bagai, R., Shanbhogue, V., Zytkow, J., Chou, S.: Automatic theorem generation in plane geometry. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, Springer, Heidelberg (1993)Google Scholar
  3. 3.
    Colton, S.: Automated Theory Formation in Pure Mathematics. Springer, Heidelberg (2002)Google Scholar
  4. 4.
    Colton, S.: The HR program for theorem generation. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, Springer, Heidelberg (2002)Google Scholar
  5. 5.
    Colton, S., Bundy, A., Walsh, T.: Automatic identification of mathematical concepts. In: Proceedings of ICML (2000)Google Scholar
  6. 6.
    Colton, S., Bundy, A., Walsh, T.: On the notion of interestingness in automated mathematical discovery. International Journal of Human Computer Studies 53(3), 351–375 (2000)MATHCrossRefGoogle Scholar
  7. 7.
    Colton, S., Meier, A., Sorge, V., McCasland, R.: Automatic generation of classification theorems for finite algebras. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 400–414. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    Epstein, S.: On the discovery of mathematical theorems. In: Proceedings of the International Joint Conference on Artificial Intellignce (1987)Google Scholar
  9. 9.
    Fajtlowicz, S.: On conjectures of Graffiti. Discrete Mathematics 72, 23 (1988)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Hentzel, I., Jacobs, D., Muddana, S.: Experimenting with the identity (xy)z = y(zx). Technical report, Clemson University (1993)Google Scholar
  11. 11.
    Humphreys, J.: A Course in Group Theory. In: OUP (1996)Google Scholar
  12. 12.
    Jacobs, D.: The Albert non-associative algebra system: a progress report. Technical report, Clemson University (1994)Google Scholar
  13. 13.
    Koutsofios, E., North, C.: Dot user’s guide. Technical report, AT+T Bell Labs, Murray Hill, NJ (1998)Google Scholar
  14. 14.
    Lakatos, I.: Proofs and Refutations: The logic of mathematical discovery. Cambridge University Press, Cambridge (1976)MATHGoogle Scholar
  15. 15.
    Lenat, D.: AM: Discovery in mathematics as heuristic search. In: Knowledge-Based Systems in Artificial Intelligence, McGraw-Hill, New York (1982)Google Scholar
  16. 16.
    McCune, W.: The OTTER user’s guide. Technical Report ANL/90/9, Argonne National Laboratories (1990)Google Scholar
  17. 17.
    McCune, W.: A Davis-Putnam program and its application to finite first-order model search. Technical Report MCS-TM-194, Argonne National Labs (1994)Google Scholar
  18. 18.
    Pease, A., Colton, S.: Modelling Lakatos’s philosophy of mathematics. In: Proceedings of the Second European Conference on Computing and Philosophy (2004)Google Scholar
  19. 19.
    Pistori, H., Wainer, J.: Automatic theory formation in graph theory. In: Argentine Symposium on Artificial Intelligence, pp. 131–140 (1999)Google Scholar
  20. 20.
    Ritchie, G., Hanna, F.: AM: A case study in methodology. Artificial Intelligence 23 (1984)Google Scholar
  21. 21.
    Sims, M.: IL: An Artificial Intelligence approach to theory formation in mathematics. PhD thesis, Rutgers University (1990)Google Scholar
  22. 22.
    Sutcliffe, G., Suttner, C.: The TPTP problem library: CNF release v1.2.1. Journal of Automated Reasoning 21(2), 177–203 (1998)MATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Torres, P., Colton, S.: Applying model generation to concept formation. In: Proceedings of the Automated Reasoning Workshop (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Simon Colton
    • 1
  • Pedro Torres
    • 1
    • 4
  • Paul Cairns
    • 2
  • Volker Sorge
    • 3
  1. 1.Department of ComputingImperial CollegeLondonUK
  2. 2.UCL Interaction CentreUniversity CollegeLondonUK
  3. 3.School of ComputingUniversity of BirminghamUK
  4. 4.Supported by Fundação para a Ciência e a Tecnologia,(SFRH/BD/12437/2003) 

Personalised recommendations