Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lin, H., Sun, J.G., Zhang, Y.M.: Theorem proving based on extension rule. Journal of Automated Reasoning 31, 11–21 (2003)
Wu, X., Sun, J.G., Lu, S., Yin, M.H.: Propositional extension rule with reduction. International Journal of Computer Science and Network Security 6, 190–195 (2006)
Wu, X., Sun, J.G., Lu, S., Li, Y., Meng, W.: Improved propositional extension rule. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS, vol. 4062, pp. 592–597. Springer, Heidelberg (2006)
Wu, X., Sun, J.G., Hou, K.: Extension rule in first order logic. In: Proceeding of 5th International Conference on Cognitive Informatics (ICCI 2006), Beijing, China (to appear, 2006)
Chu, H., Plaisted, D.A.: Semantically Guided First-Order Theorem Proving Using Hyper-Linking. In: Proceeding of 12th Conference on Automated Deduction, Nancy, France, pp. 192–206 (1994)
Paramasivam, M., Plaisted, A.D.: A replacement rule theorem prover. Journal of Automated Reasoning 18, 221–226 (1997)
Jeroslow, R.G.: Computation-oriented reductions of predicate to propositional logic. Decision Support Systems 4, 183–197 (1988)
Chang, C., Lee, R.C.: Symbolic logic and mechanical theorem proving. Academic Press, London (1973)
Kautz, H., Selman, B.: Planning as satisfiability. In: Proceeding of the 10th European Conference on Artificial Intelligence, Vienna, Austria, pp. 359–363 (1992)
Wu, X., Sun, J.G., Feng, S.S.: Destructive extension rule in modal logic K. In: Proceeding of International Conference of Computational Methods, Singapore (2004)
Wu, X., Sun, J.G., Lin, H., Feng, S.S.: Modal extension rule. Process In Natural Science, China 6, 550–558 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, X., Sun, J., Hou, K. (2006). An Extension Rule Based First-Order Theorem Prover. In: Lang, J., Lin, F., Wang, J. (eds) Knowledge Science, Engineering and Management. KSEM 2006. Lecture Notes in Computer Science(), vol 4092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811220_43
Download citation
DOI: https://doi.org/10.1007/11811220_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37033-8
Online ISBN: 978-3-540-37035-2
eBook Packages: Computer ScienceComputer Science (R0)