Skip to main content

Paramodulation and set of support

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

Keywords

  • Inference System
  • Completeness Theorem
  • Automatic Theorem Prove
  • Empty Clause
  • Term Occurrence

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, 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. Andrews, P. "Resolution with Merging." J. ACM 15 (1968), pp. 367–381.

    CrossRef  MATH  Google Scholar 

  2. Darlington, J. "Theorem-proving and Information Retrieval." Machine Intelligence IV (1969), ed. by D. Michie and B. Meltzer.

    Google Scholar 

  3. Green, C. "Theorem-proving by Resolution as a Basis for Question-answering Systems." Machine Intelligence IV (1969), ed. by D. Michie and B. Meltzer.

    Google Scholar 

  4. Robinson, G., Wos, L., and Carson, D. "Some Theorem-proving Strategies and Their Implementation," AMD Technical Memorandum #72, Argonne National Laboratory (1964).

    Google Scholar 

  5. Robinson, G., and Wos, L. "Completeness of Paramodulation." (Abstract), J. Symb. Logic, 34 (1969), p. 160.

    Google Scholar 

  6. Robinson, G., and Wos, L. "Paramodulation and Theorem-proving in First-order Theories with Equality." Machine Intelligence IV (1969), ed. by D. Michie and B. Meltzer, pp. 135–150.

    Google Scholar 

  7. Robinson, J. "A Machine-oriented Logic Based on the Resolution Principle." J. ACM 12 (1965), pp. 23–41.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Robinson, J. "Automatic Deduction with Hyper Resolution." Internat. J. Assoc. Comput. Math. 1 (1965), pp. 227–234.

    MathSciNet  MATH  Google Scholar 

  9. Slagle, J. "Automatic Theorem Proving with Renamable and Semantic Resolution." J. ACM 14 (1967), pp. 687–697.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. 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 

  11. Wos, L., and Robinson, G. "The Maximal Model Theorem." (Abstract), J. Symb. Logic, 34 (1969), pp. 159–160.

    Google Scholar 

  12. Wos, L. and Robinson, G. "Maximal Models and Refutation Completeness." (Unpublished)

    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

Wos, L., Robinson, G. (1970). Paramodulation and set of support. 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/BFb0060637

Download citation

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

  • 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