@INPROCEEDINGS { Rsds4282,
author = {Yin, Minghao and Yin, Minghao and Meng, Wei and Li, Ying and Lu, Shuai and Sun, Jigui and Wu, Xia}, 
title = {Improved Propositional Extension Rule}, 
booktitle = {Rough Sets and Knowledge Technology}, 
conference = {Rough Sets and Knowledge Technology}, 
series =  = {Lecture Notes in Computer Science}, 
volume = 4062, 
pages = {592--597}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
year = 2006, 
editor = {Wang, Guoying and Peters, James F. and Skowron, Andrzej and Yao, Yiyu}, 
isbn = {978-3-540-36297-5}, 
abstract = {Method based on extension rule is a new method for theorem proving, whether or not it will behave well in theorem proving depends on the efficiency. Moreover, the efficiency of propositional extension rule will affect that of first order extension rule directly. Thus the efficiency of the propositional extension rule is very important. ER and IER are two extension rule methods Lin gave. We have improved the ER method before. In order to increase the efficiency of IER, this paper improves IER by some reduction rules. And then the soundness and completeness of it is proved. We also report some preliminary computational results.}, 
keywords = {extension rule, propositional logic, reduced rule, theorem proving, }, 
}