Refinement theorems in resolution theory

  • David Luckham
Conference paper
First Online:
Part of the Lecture Notes in Mathematics book series (LNM, volume 125)

Abstract

The paper discusses some basic refinements of the Resolution Principle which are intended to improve the speed and efficiency of theorem-proving programs based on this rule of inference. It is proved that two of the refinements preserve the logical completeness of the proof procedure when used separately, but not when used in conjunction. The results of some preliminary experiments with the refinements are given.

Keywords

Leaf Node Function Symbol Support Strategy Proof Tree Automatic Deduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Andrews, P. B., "Resolution with Merging", JACM, 15, No. 3, pp. 367–381, July 1968.CrossRefMATHGoogle Scholar
  2. [2]
    Luckham, D., "The Resolution Principle in Theorem-Proving", Machine Intelligence 1, Collins and Michie (Eds), American Elsevier Inc., New York, 1967.Google Scholar
  3. [3]
    Luckham, D., "Some Tree-Paring Strategies for Theorem-Proving", Machine Intelligence 3, D. Michie (Ed), Edinburgh University Press, pp. 95–112, 1968.Google Scholar
  4. [4]
    Robinson, J. A., "A Machine-Oriented Logic Based on the Resolution Principle", JACM, 12, No. 1, pp. 23–41, January 1965.MathSciNetCrossRefMATHGoogle Scholar
  5. [5]
    Robinson, J. A., "Automatic Deduction with Hyper-Resolution", International Journal of Computer Mathematics, Vol. 1, pp. 227–234, 1965.MathSciNetMATHGoogle Scholar
  6. [6]
    Slagle, J. R., "Automatic Theorem-Proving with Renamable and Semantic Resolution", JACM, 14, pp. 687–697, October 1967.MathSciNetCrossRefMATHGoogle Scholar
  7. [7]
    Wos, L., Robinson, G., Carson, D., "Efficiency and Completeness of the Set of Support Strategy in Theorem Proving", JACM, 12, No. 4, pp. 536–541, October 1965.MathSciNetCrossRefMATHGoogle Scholar
  8. [8]
    Wos, L., Robinson, G., Carson, D., Shalla, L., "The Concept of Demodulation in Theorem-Proving", JACM, 14, No. 4, pp. 698–704.Google Scholar
  9. [9]
    Wos, L., and Robinson, G., "The Maximal Model Theorem", Abstract, Spring 1968 meeting of Association for Symbolic Logic, to appear in J. Symb. Logic.Google Scholar

Copyright information

© Springer-Verlag 1970

Authors and Affiliations

  • David Luckham

There are no affiliations available

Personalised recommendations