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.
Unable to display preview. Download preview PDF.
- 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