A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Collaborating With A Genetic Programming System To Generate Modular Robotic Code
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Handbook of automated reasoning
Handbook of automated reasoning
Theorem Proving Based on the Extension Rule
Journal of Automated Reasoning
An extension rule based first-order theorem prover
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Hi-index | 0.00 |
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