Eliminating redundant search space on backtracking for forward chaining theorem proving

  • Authors:

  • Lifeng He;Yuyan Chao;Hidenori Itoh

  • Affiliations:

  • Faculty of Information Science and Technology, Aichi Prefectural University, Aichi, 480-1198, Japan;Faculty of Environment, Information and Business, Nagoya Sangyo University, Aichi, 488-8711, Japan;Department of Artificial Intelligence and Computer Science, Nagoya Institute of Technology Nagoya, 466-8555, Japan

  • Venue:
  • Journal of Computer Science and Technology
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.