Skip to main content

Negative paramodulation

  • Equality Reasoning
  • Conference paper
  • First Online:
8th International Conference on Automated Deduction (CADE 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 230))

Included in the following conference series:

Abstract

In this paper, we introduce the inference rule negative paramodulation. This rule reasons from inequalities, in contrast to paramodulation which reasons from equalities. Negative paramodulation is recommended for use when certain conditions are satisfied; here we give those conditions. We present experimental evidence that suggests the potential value of employing the closely related inference rule negative hyperparamodulation.

This work was supported by the Applied Mathematical Sciences subprogram of the office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lusk, E., McCune, W., and Overbeek, R., “Logic Machine Architecture: Kernel Functions”, Proceedings of the 6th Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science (ed. D. Loveland), vol. 138, pp. 70–84 (June 1982).

    Google Scholar 

  2. Robinson, G., and Wos, L., “Paramodulation and theorem proving in first-order theories with equality”, Machine Intelligence (ed. Meltzer and Michie), vol. 4, American Elsevier, New York, pp. 135–150 (1969).

    Google Scholar 

  3. Stickel, M., “A case study of theorem proving by the Knuth-Bendix Method: discovering that x 3=x implies ring commutativity”, Proceedings of the 7th Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science (ed. R. Shostak), vol. 170, pp. 248–258 (May 1984).

    Google Scholar 

  4. Wos, L., Overbeek R., and Henschen, L., “Hyperparamodulation: A refinement of paramodulation”, Proceedings of the 5th Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science (eds. R. Kowalski and W. Bibel), vol. 87, pp. 208–219 (July 1980).

    Google Scholar 

  5. Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications, Prentice-Hall, Englewood Cliffs, N.J. (Feb. 1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wos, L., McCune, W. (1986). Negative paramodulation. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_93

Download citation

  • DOI: https://doi.org/10.1007/3-540-16780-3_93

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16780-8

  • Online ISBN: 978-3-540-39861-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics