I-SATCHMO: An Improvement of SATCHMO

  • Authors:

  • Lifeng He

  • Affiliations:

  • Faculty of Information Science and Technology, Aichi Prefectural University, Nagakute-cho, Aichi-gun, Aichi, 480-1198 Japan

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

We introduce a method for reducing the redundant search space for SATCHMO's model generation approach by means of intelligent backtracking. During the reasoning, we mark an asserted consequent atom as “useful” whenever it has been used as an antecedent atom for forward chaining. We show that a splitting of the consequence of a non-Horn clause is unnecessary if one of its consequent atoms is found not to be “useful” at the time it is retracted from the database on backtracking, and therefore the remaining splitting over the clause's consequence can be immediately abandoned. In this way, much of the redundant search space can be eliminated. Our method is simple in principle, easy to implement in Prolog, independent of other refinements, and effective for model generation theorem proving.