Abstract
We show how a generalization operator may be incorporated into resolution as a method of guiding the search for a proof. After each resolution, a “generalization operation” may be performed on the resulting caluse. This leads to a more general proof than the usual resolution proof. These general proofs may then be used as guides in the search for an ordinary resolution proof. This method overcomes some of the limitations of the abstraction strategies with which the author has experimented for several years. Some of the results of these previous experiments and comparisons of the two approaches are given.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
9. References
Andrews, P.B., Theorem proving via general matings, J. ACM 28 (1981) 193–214.
Bibel, W., Automated Theorem Proving, Vieweg, 1982.
Boyer, R., Locking, a restriction of resolution, Ph.D. thesis, University of Texas at Austin, TX (1971).
Bundy, A., The Computer Modelling of Mathematical Reasoning (Academic Press, New York, 1983).
Chang, C. and Lee, R., Symbolic Logic and Mechanical Theorem Proving (Academic Press, New York, 1973).
Kling, R., A paradigm for reasoning by analogy, Aritifical Intelligence 2 (1971) 147–178.
Loveland, D., Automated theorem proving: a quarter century review, in Automated Theorem Proving: After 25 Years, W. Bledsoe and D. Loveland, eds., (American Mathematical Society, Providence, RI, 1984), pp. 1–45.
Manna, Z., Mathematical Theory of Computation (McGraw-Hill, New York, 1974).
Plaisted, D., and Greenbaum, S., Problem representations for back chaining and equality in resolution theorem proving, First Annual AI Applications Conference, Denver, Colorado, December, 1984.
Plaisted, D., Theorem proving with abstraction, Artificial Intelligence 16 (1981) 47–108.
Plaisted, D., A simplified problem reduction format, Artificial Intelligence 18 (1982) 227–261.
Robinson, J., A machine oriented logic based on the resolution principle, J. ACM 12 (1965) 23–41.
Stickel, M.E., A Prolog technology theorem prover, Proceedings of the 1984 International Symposium on Logic Programming, IEEE, Atlantic City, New Jersey, February, 1984, pp. 212–217.
Winston, P.H., Artificial Intelligence (Addison-Wesley, Reading, Mass., 1977).
Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Plaisted, D.A. (1986). Abstraction using generalization functions. 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_103
Download citation
DOI: https://doi.org/10.1007/3-540-16780-3_103
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