Skip to main content

A Set of Metrics for Measuring Interestingness of Theorems in Automated Theorem Finding by Forward Reasoning: A Case Study in NBG Set Theory

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 9243))

Abstract

The problem of automated theorem finding is one of 33 basic research problems in automated reasoning which was originally proposed by Wos in 1988, and it is still an open problem. The problem implicitly requires some metrics to be used for measuring interestingness of found theorems. However, no one addresses that requirement until now. This paper proposes the first set of metrics for measuring interestingness of theorems. The paper also presents a case study in NBG set theory, in which we use the proposed metrics to measure the interestingness of the theorems of NBG set theory obtained by using forward reasoning approach and confirms the effectiveness of the metrics.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Cheng, J.: A relevant logic approach to automated theorem finding. In: The Workshop on Automated Theorem Proving attached to International Symposium on Fifth Generation Computer Systems, pp. 8–15 (1994)

    Google Scholar 

  2. Cheng, J.: Entailment calculus as the logical basis of automated theorem finding in scientific discovery. In: Systematic Methods of Scientific Discovery: Papers from the 1995 Spring Symposium, AAAI Press - American Association for Artificial Intelligence, pp. 105–110 (1995)

    Google Scholar 

  3. Cheng, J.: A strong relevant logic model of epistemic processes in scientific discovery. In: Information Modelling and Knowledge Bases XI, Frontiers in Artificial Intelligence and Applications, vol. 61, pp. 136–159. IOS Press (2000)

    Google Scholar 

  4. Cheng, J., Nara, S., Goto, Y.: FreeEnCal: a forward reasoning engine with general-purpose. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part II. LNCS (LNAI), vol. 4693, pp. 444–452. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Colton, S.: Automated theorem discovery: a future direction for theorem provers. In: Proceedings of 1st Automated Reasoning: International Joint Conference, Workshop on Future Directions in Automated Reasoning, pp. 38–47 (2001)

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Dalzotto, G., Recio, T.: On protocols for the automated discovery of theorems in elementary geometry. J. Autom. Reasoning 43(2), 203–236 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gao, H., Goto, Y., Cheng, J.: A systematic methodology for automated theorem finding. Theoret. Comput. Sci. 554, 2–21 (2014). Elsevier

    Article  MathSciNet  MATH  Google Scholar 

  9. Gao, H., Goto, Y., Cheng, J.: Research on automated theorem finding: current state and future directions. In: Park, J.J., Pan, Y., Kim, C.-S., Yang, Y. (eds.) Future Information Technology. LNEE, vol. 309, pp. 105–110. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  10. McCasland, R., Bundy, A., Autexier, S.: Automated discovery of inductive theorems. J. Stud. Log. Gramm. Rhetor. 10(23), 135–149 (2007)

    Google Scholar 

  11. Montes, A., Recio, T.: Automatic discovery of geometry theorems using minimal canonical comprehensive gröbner systems. In: Botana, F., Recio, T. (eds.) ADG 2006. LNCS (LNAI), vol. 4869, pp. 113–138. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Puzis, Y., Gao, Y., Sutcliffe, G.: Automated generation of interesting theorems. In: Proceedings of 19th International Florida Artificial Intelligence Research Society Conference, AAAI press-The Association for the Advancement of Artificial Intelligence, pp. 49–54 (2006)

    Google Scholar 

  13. Quaife, A.: Automated Development of Fundamental Mathematical Theories. Kluwer Academic, Dordrecht (1992)

    MATH  Google Scholar 

  14. Recio, T., Velez, M.Z.: Automatic discovery of theorems in elementary geometry. J. Autom. Reasoning 23(1), 63–82 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Wos, L.: Automated Reasoning: 33 Basic Research Problem. Prentice-Hall, Upper Saddle River (1988)

    MATH  Google Scholar 

  16. Wos, L.: The problem of automated theorem finding. J. Autom. Reasoning 10(1), 137–138 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jingde Cheng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Gao, H., Goto, Y., Cheng, J. (2015). A Set of Metrics for Measuring Interestingness of Theorems in Automated Theorem Finding by Forward Reasoning: A Case Study in NBG Set Theory. In: He, X., et al. Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques. IScIDE 2015. Lecture Notes in Computer Science(), vol 9243. Springer, Cham. https://doi.org/10.1007/978-3-319-23862-3_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23862-3_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23861-6

  • Online ISBN: 978-3-319-23862-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics