Journal of Automated Reasoning
A-SATCHMORE: SATCHMORE with availability checking
New Generation Computing
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
I-SATCHMO: An Improvement of SATCHMO
Journal of Automated Reasoning
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
R-UNSEARCHMO: A Refinement on UNSEARCHMO
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy
New Generation Computing
Eliminating redundant search space on backtracking for forward chaining theorem proving
Journal of Computer Science and Technology
Hi-index | 0.00 |
This paper introduces how to eliminate redundant search space for forward chaining theorem proving as much as possible. We consider how to keep on minimal useful consequent atom sets for necessary branches in a proof tree. In the most cases, an unnecessary non-Horn clause used for forward chaining will be split only once. The increase of the search space by invoking unnecessary forward chaining clauses will be nearly linear, not exponential anymore. In a certain sense, we "unsearch" more than necessary. We explain the principle of our method, and provide an example to show that our approach is powerful for forward chaining theorem proving.