I-SATCHMORE: An improvement ofA-SATCHMORE

  • LiFeng He
  • Chao Yuyan
  • Nakamura Tsuyoshi
  • Itoh Hidenori
Correspondence
Received:
Revised:

Abstract

This paper presents an improvement ofA-SATCHMORE (SATCHMORE with Availability).A-SATCHMORE incorporates relevancy testing and availability checking into SATCHMO to prune away irrelevant forward chaining. However, considering every consequent atom of those non-Horn clauses being derivable,A-SATCHMORE may suffer from a potential explosion of the search space when some of such consequent atoms are actually underivable. This paper introduces a solution for this problem and shows its correctness.

Keywords

theorem proving availability forward chaining SATCHMO SATCHMORE A-SATCHMORE 
This is a preview of subscription content, log in to check access.

References

  1. [1]
    Manthey R, Bry F. SATCHMO: A theorem prover implemented in Prolog. InProc. 9th Int. Conf. on Automated Deduction, 1988.Google Scholar
  2. [2]
    Ramsay D W. Generating relevant models.Journal of Automated Reasoning, 1991, 7: 359–368.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    Loveland D W, Reed D W, Wilson D S. SATCHMORE: SATCHMO with Relevancy.Journal of Automated Reasoning, 1995, 14: 325–351.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    He L, Chao Y, Simajiri Y, Seki H, Itoh H.A-SATCHMORE: SATCHMORE with availability checking.New Generation Computing, 1998, 16: 55–74.CrossRefGoogle Scholar
  5. [5]
    Bry F, Yahya A. Positive unit hyperresolution tableaux and their application to minimal model generation.Journal of Automated Reasoning, 2000, 25: 35–82.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    Stickel M E. Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction.Journal of Automated Reasoning, 1994, 13: 189–210.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    Demolombe R. An efficient strategy for non-horn deductive databases.Theoretical Computer Science, 1991, 78: 245–249.MATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    Lloyd J W. Foundations of logic programming (second Edition). Springer-Verlag, Heidelberg, 1987.MATHGoogle Scholar
  9. [9]
    Chang C L, Lee K C T. Symbolic Logic and Mechanical Theorem Proving,Academic Press, New York, 1973.MATHGoogle Scholar
  10. [10]
    Loveland D W. Automated Theorem Proving: A Logic Basis. North-Holland, Amsterdam, 1978.Google Scholar
  11. [11]
    Sutcliffe G, Suttner C. http://www.cs.jcu.edu.au/~tptp/Google Scholar
  12. [12]
    Stickel M E. Schubert's steamroller problem: Formulations and solutions.Journal of Automated Reasoning. 1986, 2: 89–101.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2003

Authors and Affiliations

  • LiFeng He
    • 1
  • Chao Yuyan
    • 2
  • Nakamura Tsuyoshi
    • 3
  • Itoh Hidenori
    • 3
  1. 1.Faculty of Information Science and TechnologyAichi Prefectural UniversityAichiJapan
  2. 2.Faculty of Environment Information and BusinessNagoya Sangyo UniversityAichiJapan
  3. 3.Department of Artificial Intelligence and Computer ScienceNagoya Institute of TechnologyNagoyaJapan

Personalised recommendations