Skip to main content

E-Resolution: Extension of Resolution to Include the Equality Relation

  • Chapter
Automation of Reasoning

Part of the book series: Symbolic Computation ((1064))

  • 559 Accesses

Abstract

The E-Resolution inference principle described in this paper is a single-inference logic system for the first-order predicate calculus with equality. Special axioms for equality (i.e., axioms for symmetry, reflexivity, transitivity, and substitutivity) are not required to be added to the original set of clauses. Other advantages of E-Resolution are the relatively small number of intermediate clauses which must be retained in a proof and the distinct possibility that search strategies suitable for Resolution will also be suitable for E-Resolution. Although it is not known whether or not E-Resolution is complete, this topic is currently being investigated by the author.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, Peter B., Resolution with Merging, J. ACM 15, 3 (July, 1968 ), 367–381.

    Google Scholar 

  2. Bledsoe, W. W., Theorem Proof Checking in Set Theory, in preparation.

    Google Scholar 

  3. Morse, A. P., A Theory of Sets Academic Press, New York, 1965.

    Google Scholar 

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

    Google Scholar 

  5. Robinson, J. A., Automatic Deduction with Hyper-Resolution, Inc. J. Comp. Math. 1, 1965, 227–234.

    MATH  Google Scholar 

  6. Robinson, J. A., The Generalized Resolution Principle, in Machine Intelligence III, D. Michie (ed.), Edinburgh University Press, 1968, 113–127.

    Google Scholar 

  7. Robinson, J. A. A Review of Automatic Theorem Proving, Proc. Symp. in Applied Mathematics, Amer. Math. Soc., Providence, R. I., 1967.

    Google Scholar 

  8. Robinson, G., and L. Wos, Paramodulation and Theorem-proving in First-order Theories with Equality. To appear in Machine Intelligence IV, D. Michie (ed.)

    Google Scholar 

  9. Sibert, E. E., A Machine-oriented Logic Incorporating the Equality Relation, Doctoral Thesis, Rice University, Houston, 1967.

    Google Scholar 

  10. Woe, L., G. Robinson, D. Carson, and L. Shalla, The Concept of Demodulation in Theorem-proving, J. ACM 14 (Oct., 1967 ), 698–709.

    Google Scholar 

  11. Woe, L., G. Robinson, and D. Carson. Efficiency and Completeness of the Set of Support Strategy in Theorem-proving, J. ACM 12 (1965), 536–541.

    Article  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Morris, J.B. (1983). E-Resolution: Extension of Resolution to Include the Equality Relation. In: Siekmann, J.H., Wrightson, G. (eds) Automation of Reasoning. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-81955-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-81955-1_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-81957-5

  • Online ISBN: 978-3-642-81955-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics