By Topic

Automated theorem finding by forward deduction based on strong relevant logic: A case study in NBG set theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hongbiao Gao ; Dept. of Inf. & Comput. Sci., Saitama Univ., Saitama, Japan ; Kai Shi ; Goto, Y. ; Jingde Cheng

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. To solve the problem, a forward deduction approach based on the strong relevant logics was proposed. To verify the effectiveness of the approach, this paper presents a case study of automated theorem finding in NBG set theory by forward deduction based on the strong relevant logics. The ultimate goal of automated theorem finding in NBG set theory is to find new and interesting theorems. As the first step, this case study tries to do “rediscovery” in NBG set theory, i.e., to deduce already proved theorems from axioms, definitions and /or other theorems of NBG set theory. However, from the viewpoint of the mechanism of deducing theorems, “re-discovery” is as same as “discovery”. The paper shows several known theorems rediscovered successfully by the approach. The paper also shows issues of the approach for real “discovery”.

Published in:

Machine Learning and Cybernetics (ICMLC), 2012 International Conference on  (Volume:5 )

Date of Conference:

15-17 July 2012