Skip to main content

Axiom systems in automatic theorem proving

Part of the Lecture Notes in Mathematics book series (LNM,volume 125)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kowalski, R., and Hayes, P. "Semantic trees in automatic theorem proving," Machine Intelligence IV, ed by Michie and B. Meltzer (1969).

    Google Scholar 

  2. Luckham, D. "Some tree-paring strategies for theorem-proving." Machine Intelligence III, ed. by M. Michie, Edinburgh Univ. Press, Edinburgh (1968).

    Google Scholar 

  3. Robinson, A. Model theory and the mathematics of algebra. North Holland, Amsterdam (1963).

    Google Scholar 

  4. Robinson, G., and Wos, L. "Paramodulation and theorem-proving in first-order theories with equality." Machine Intelligence IV, ed. by D. Michie and B. Meltzer (1969).

    Google Scholar 

  5. Robinson, J. "A machine-oriented logic based on the resolution principle." J.ACM 12 (1965), pp. 23–41.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Slagle, J. "Automatic theorem proving with renumerable and semantic resolution." J. ACM 14 (1967), pp. 687–697.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Suppes, P. Introduction to Logic, Prentice Hall, New York (1957).

    MATH  Google Scholar 

  8. Wos, L., Carson, D., and Robinson, G. "The unit preference strategy in theorem proving." AFIPS Conf. Proc. 26, Spartan Books, Washington D. C. (1964), pp. 615–621.

    Google Scholar 

  9. Wos, L., Robinson, G., and Carson, D. "Efficiency and completeness of the set of support strategy in theorem proving." J. ACM 12 (1965), pp. 536–541.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Wos, L., Robinson, G., Carson, D., and Shalla, L. "The concept of demodulation in theorem proving." J. ACM 14 (1967) pp. 698–709.

    CrossRef  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1970 Springer-Verlag

About this paper

Cite this paper

Robinson, G., Wos, L. (1970). Axiom systems in automatic theorem proving. In: Laudet, M., Lacombe, D., Nolin, L., Schützenberger, M. (eds) Symposium on Automatic Demonstration. Lecture Notes in Mathematics, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060635

Download citation

  • DOI: https://doi.org/10.1007/BFb0060635

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04914-2

  • Online ISBN: 978-3-540-36262-3

  • eBook Packages: Springer Book Archive