Explicitly Epistemic Contraction by Predicate Abstraction in Automated Theorem Finding: A Case Study in NBG Set Theory | SpringerLink
Skip to main content
Springer Nature Link
Log in

Explicitly Epistemic Contraction by Predicate Abstraction in Automated Theorem Finding: A Case Study in NBG Set Theory

  • Conference paper
  • First Online:
Intelligent Information and Database Systems (ACIIDS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9011))

Included in the following conference series:

Abstract

In automated theorem finding by forward reasoning, there are many redundant theorems as intermediate results. This paper proposes an approach of explicitly epistemic contraction by predicate abstraction for automated theorem finding by forward reasoning in order to remove redundant theorems in a set of obtained theorems, and shows the effectiveness of the explicitly epistemic contraction by a case study of automated theorem finding in NBG set theory.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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 (2000)

    Google Scholar 

  2. Cheng, J.: A Semilattice Model for the Theory Grid. In: Proc. 3rd International Conference on Semantics, Knowledge and Grid, IEEE Computer Society, pp. 152–157 (2007)

    Google Scholar 

  3. 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 

  4. Gao, H., Goto, Y., Cheng, J.: A Systematic Methodology for Automated Theorem Finding. Theoretical Computer Science 554, 2–21 (2014)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  6. Takahashi, I., Nara, S., Goto, Y., Cheng, J.: EPLAS: An Epistemic Programming Language for All Scientists. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007, Part I. LNCS, vol. 4487, pp. 406–413. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Wos, L.: Automated Reasoning: 33 Basic Research Problem. Prentic-Hall (1988)

    Google Scholar 

  8. Wos, L.: The Problem of Automated Theorem Finding. Journal of Automated Reasoning 10(1), 137–138 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Computer Sciences, Saitama University, Saitama, 338-8570, Japan

    Hongbiao Gao, Yuichi Goto & Jingde Cheng

Authors
  1. Hongbiao Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuichi Goto
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jingde Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jingde Cheng .

Editor information

Editors and Affiliations

  1. Ton Duc Thang University, Ho Chi Minh city, Vietnam

    Ngoc Thanh Nguyen

  2. Wroclaw University of Technology, Wroclaw, Poland

    Bogdan Trawiński

  3. Bina Nusantara University, Jakarta, Indonesia

    Raymond Kosala

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). Explicitly Epistemic Contraction by Predicate Abstraction in Automated Theorem Finding: A Case Study in NBG Set Theory. In: Nguyen, N., Trawiński, B., Kosala, R. (eds) Intelligent Information and Database Systems. ACIIDS 2015. Lecture Notes in Computer Science(), vol 9011. Springer, Cham. https://doi.org/10.1007/978-3-319-15702-3_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15702-3_57

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation