Eliminating redundant search space on backtracking for forward chaining theorem proving
- 42 Downloads
This paper introduces some improvements on the intelligent backtracking strategy for forward chaining theorem proving. How to decide a minimal useful consequent atom set for a refutation derived at a node in a proof tree, is discussed. In 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 this paper, the principle of the proposed method and its correctness are introduced. Moreover, some examples are provided to show that the proposed approach is powerful for forward chaining theorem proving.
Keywordstheorem proving forward chaining SATCHMO I-SATCHMO model generation
- Manthey R, Bry F. SATCHMO: A theorem prover implemented in Prolog. InProc. 9th Intl. Conf. Automated Deduction, Argonne, USA, 1988, pp.415–434.Google Scholar
- He L, Chao Y, Simajiri Y, Seki H, Itoh H.A-SATCHMORE: SATCHMORE with availability checking.New Generation Computing, 1998, 16: 55–74.Google Scholar
- Sutcliffe G, Suttner C. The TPTP problem library for automated theorem proving. http://www.cs.miami. edu/~tptp/Google Scholar
- He L. UNSEARCHMO: Eliminating redundant search space on backtracking for forward chaining theorem proving. InIJCAI'2001, Seatle, USA, 2001, pp.618–623.Google Scholar