UNSEARCHMO: Eliminating Redundant Search Space on Backtracking for Forward Chaining Theorem Proving
Abstract
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.
Cite
Text
He. "UNSEARCHMO: Eliminating Redundant Search Space on Backtracking for Forward Chaining Theorem Proving." International Joint Conference on Artificial Intelligence, 2001.Markdown
[He. "UNSEARCHMO: Eliminating Redundant Search Space on Backtracking for Forward Chaining Theorem Proving." International Joint Conference on Artificial Intelligence, 2001.](https://mlanthology.org/ijcai/2001/he2001ijcai-unsearchmo/)BibTeX
@inproceedings{he2001ijcai-unsearchmo,
title = {{UNSEARCHMO: Eliminating Redundant Search Space on Backtracking for Forward Chaining Theorem Proving}},
author = {He, Lifeng},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2001},
pages = {618-623},
url = {https://mlanthology.org/ijcai/2001/he2001ijcai-unsearchmo/}
}