By Topic

Extension Rule in First Order Logic

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
$33 $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

3 Author(s)
Xia Wu ; College of Computer Science and Technology, Jilin University, 130012 Changchun, China; Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education, 130012 Changchun, China, yexia ; Jigui Sun ; Kun Hou

The extension rule (ER) is a new method for theorem proving, which is potentially a complementary method to resolution-based methods. But the first-order ER method is incomplete. We improve the first-order ER approach by (a) revise the definition of the potential blockage, give a complete first-order ER algorithm, (b) increasing the case M-satisfiability by giving a bound M, so as to make the ER method more useful for theorem proving and logic programming, and (c) accelerating it through invoking the more efficient proposition ER method. We also prove the soundness and completeness of the improved first-order ER algorithm and report some preliminary computational results

Published in:

2006 5th IEEE International Conference on Cognitive Informatics  (Volume:2 )

Date of Conference:

17-19 July 2006