An Extension Rule Based First-Order Theorem Prover

Methods based on resolution have been widely used for theorem proving since it was proposed. The extension rule (ER) method is a new method for theorem proving, which is potentially a complementary method to resolution-based methods. But the first-order ER approach is incomplete and not realized. This paper gives a complete first-order ER algorithm and describes the implementation of a theorem prover based on it and its application to solving some planning problems. We also report the preliminary computational results on first-order formulation of planning problems.

[1]  Robert G. Jeroslow,et al.  Computation-oriented reductions of predicate to propositional logic , 1988, Decis. Support Syst..

[2]  Jigui Sun,et al.  Propositional Extension Rule with Reduction , 2006 .

[3]  David A. Plaisted,et al.  Semantically Guided First-Order Theorem Proving using Hyper-Linking , 1994, CADE.

[4]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[5]  Ying Li,et al.  Improved Propositional Extension Rule , 2006, RSKT.

[6]  Zhang Yimin,et al.  Theorem Proving Based on the Extension Rule , 2003 .

[7]  Jigui Sun,et al.  Extension Rule in First Order Logic , 2006, 2006 5th IEEE International Conference on Cognitive Informatics.

[8]  Sun Ji-gui,et al.  Modal extension rule , 2005 .

[9]  David A. Plaisted,et al.  RRTP - A Replacement Rule Theorem Prover , 2004, Journal of Automated Reasoning.

[10]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.