An extension rule based first-order theorem prover

Authors:
Xia Wu;Jigui Sun;Kun Hou
Affiliations:
College of Computer Science and Technology, Jilin University, Changchun, China;College of Computer Science and Technology, Jilin University, Changchun, China;College of Computer Science and Technology, Jilin University, Changchun, China
Venue:
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Year:
2006

Citing 8
Cited 0

Computation-oriented reductions of predicate to propositional logic

Decision Support Systems
Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
RRTP - A Replacement Rule Theorem Prover

Journal of Automated Reasoning
Semantically Guided First-Order Theorem Proving using Hyper-Linking

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Theorem Proving Based on the Extension Rule

Journal of Automated Reasoning
Extension Rule in First Order Logic

ICCI '06 Proceedings of the 2006 5th IEEE International Conference on Cognitive Informatics - Volume 02
Improved propositional extension rule

RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology

Quantified Score

Hi-index	0.00

Visualization

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.