Skip to main content

Paramodulation and Theorem-Proving in First-Order Theories with Equality

  • Chapter
Automation of Reasoning

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

Abstract

A term is an individual constant or variable or an n-adic function letter followed by n terms. An atomic formula is an n-adic predicate letter followed by n terms. A literal is an atomic formula or the negation thereof. A clause is a set of literals and is thought of as representing the universally-quantified disjunction of its members. It will sometimes be notationally convenient1 to distinguish between the empty clause □, viewed as a clause, and ‘other’ empty sets such as the empty set of clauses, even though all these empty sets are the same set-theoretic object ø. A ground clause (term, literal) is one with no variables. A clause C’ (literal, term) is an instance of another clause C (literal, term) if there is a uniform replacement of the variables in C by terms that transform C into C’.

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

  • Church, A. (1956) Introduction to mathematical logic I. Princeton.

    Google Scholar 

  • Darlington, J. L. (1968) Automatic theorem proving with equality substitutions and mathematical induction. Machine Intelligence 3, pp.113–27 (ed. Michie, D.). Edinburgh: Edinburgh University Press.

    Google Scholar 

  • Davis, M. & Putnam, H. (1960) A computing procedure for quantification theory. J. Assn. Comput. Mach., 7, 201–15.

    Article  MATH  MathSciNet  Google Scholar 

  • Quine, W.V.O. (1963) Set theory and its logic. Cambridge, Mass: Harvard University Press.

    Google Scholar 

  • Robinson, J.A. (1965) A machine-oriented logic based on the resolution principle. J. Assn. Comput. Mach., 12, 23–41.

    Article  MATH  Google Scholar 

  • Slagle, J. R. (1967) Automatic theorem proving with renamable and semantic resolution. J. Assn. Comput. Mach., 14, pp. 687–97.

    Article  MATH  MathSciNet  Google Scholar 

  • Wos, L., & Carson, D. & Robinson, G. (1964a) The unit-preference strategy in theorem proving. AFIPS Conference Proceedings, 26, Washington D.C.: Spartan Books, 615–21.

    Google Scholar 

  • Robinson, G.A., Wos, L.T. & Carson, D. (1964b) Some theorem-proving strategies and their implementation. AMD Tech. Memo No. 72, Argonne National Laboratory.

    Google Scholar 

  • Wos, L., Robinson, G.A. & Carson, D. F. (1965) Efficiency and completeness of the set of support strategy in theorem proving. J. Assn. Comput. Mach., 12, 536–41.

    Article  MATH  MathSciNet  Google Scholar 

  • Robinson, G.A., Wos, L. & Shalla, L. (1967a) Two inference rules for first-order predicate calculus with equality. AMD Tech. Memo No. 142, Argonne National Laboratory.

    Google Scholar 

  • Wos, L., Robinson, G.A., Carson, D. F. & Shalla, L. (1967b) The concept of demodulation in theorem proving. J. Assn. Comput. Mach., 14, 698–709.

    MATH  Google Scholar 

  • Robinson, G. & Wos, L. (1967c) Dependence of equality axioms in elementary group theory. Comp. Group Tech. Memo No. 53, Stanford Linear Accelerator Center.

    Google Scholar 

  • Wos, L. & Robinson, G. (1968a), The maximal model theorem. Spring 1968 meeting of Assn. for Symbolic Logic. Abstract to appear in J. Symb. Logic.

    Google Scholar 

  • Robinson, G. & Wos. L. (1968b) Completeness of paramodulation. Spring 1968 meeting of Assn for Symbolic Logic. Abstract to appear in J. Symb. Logic.

    Google Scholar 

  • Wos, L. & Robinson, G. (1968c) Maximal models and refutation completeness (unpublished).

    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

Robinson, G., Wos, L. (1983). Paramodulation and Theorem-Proving in First-Order Theories with Equality. 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_19

Download citation

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

  • 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