Improved propositional extension rule. (English) Zbl 1196.03014
Wang, Guoyin (ed.) et al., Rough sets and knowledge technology. First international conference, RSKT 2006, Chongqing, China, July 24–26, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-36297-5/pbk). Lecture Notes in Computer Science 4062. Lecture Notes in Artificial Intelligence, 592-597 (2006).
Summary: A method based on the 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 the propositional extension rule will affect that of the first-order extension rule directly. Thus the efficiency of the propositional extension rule is very important. ER and IER are two extension rule methods that 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.
For the entire collection see [Zbl 1113.68013].
For the entire collection see [Zbl 1113.68013].
MSC:
| 03B35 | Mechanization of proofs and logical operations |
| 68T15 | Theorem proving (deduction, resolution, etc.) (MSC2010) |
