Keywords
- Derivation Tree
- Nucleus Parent
- Existential Quantifier
- Ground Instance
- Unit Clause
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andrews, P.B.,, "Resolution with Merging", Journal of the Association for Computing Machinery, 15, 367–381, July 1968.
Brown, T.C. Jr., "Resolution with Covering strategies and Equality Theory", internal memorandum, California Institute of Technology, 1968.
Chang, C.L., "Renamable Paramodulation for Automatic Theorem-Proving with Equality", internal memorandum, National Institutes of Health, Bethesda, Maryland, 1969.
Darlington, J.L., "Automatic Theorem-Proving with Equality Substitutions and Mathematical Induction", Machine Intelligence 3, edited D. Michie, Edinburgh University Press, 113–127, 1968.
Hayes, P.J., and Kowalski, R., "Semantic Trees in Automatic Theorem-Proving", Machine Intelligence 4, edited B. Meltzer and D. Michie, Edinburgh University Press, 1969.
Kowalski, R., "Studies in the Completeness and Efficiency of Theorem-Proving by Resolution", Ph.D. thesis, University of Edinburgh, 1969.
Lee, Char-tung, "A Completeness Theorem and a Computer Program for Finding Theorems Derivable from Given Axioms", Ph.D. thesis, University of California, Berkeley, 1967.
Meltzer, B., "Theorem-Proving for Computers: some results on resolution and renaming", Computer J. 8, 341–343, 1966.
Meltzer, B., "Some Notes on Resolution Strategies", Machine Intelligence 3, edited D. Michie, Edinburgh University Press, 71–76, 1968.
Morris, J.B., "E-Resolution: Extension of Resolution to Include the Equality Relation", Proceedings of the International Joint Conference on Artificial Intelligence, Washington, D.C., 1969.
Robinson, J.A., "Automatic Deduction with Hyper-resolution", Int. J. Computer Math. 1, 227–234, 1965.
Robinson, J.A., "A Review of Automatic Theorem-Proving", Proceedings of Symposia in Applied Mathematics, 19, Mathematical Aspects of Computer Science, American Mathematical Society, 1967.
Robinson, J.A., "The Generalised Resolution Principle", Machine Intelligence 3, edited D. Michie, Edinburgh University Press, 77–93, 1968.
Robinson, J.A., "The Present State of Mechantal Theorem-Proving", Fourth Annual Systems Symposium, to appear in Proceedings.
Robinson, G., and Wos, L., "Paramodulation and Theorem-Proving in First-Order Theories with Equality", Machine Intelligence 4, edited B. Meltzer and D. Michie, Edinburgh University Press, 1969.
Robinson, G., and Wos, L., "Completeness of Paramodulation", Journal of Symbolic Logic, 34, 160, March, 1969.
Silbert, E.E., "A Machine-Oriented Logic Incorporating the Equality Relation", Machine Intelligence 4, edited B. Meltzer and D. Michie, Edinburgh University Press, 1969.
Slagle, J.R., "Automatic Theorem Proving With Renamable and Semantic Resolution", Journal of the Association for Computing Machinery, 14, 687–697, October 1967.
Slagle, J., Chang, C. and Lee, C., "Completeness Theorems for Semantic Resolution in Consequence Finding", Proceedings of the International Joint Conference on Artificial Intelligence, Washington, D.C., 1969.
Wos, L., Carson, D., and Robinson, G., "The Unit Preference Strategy in Theorem Proving", A.F.I.P.S. Conference Proceedings 26, Washington, D.C., 615–621: Spartan Books, 1964.
Wos, L., Robinson, G., Carson, D.F., and Shalla, L., "The Concept of Demodulation in Theorem-Proving", Journal of the Association for Computing Machinery, 14, 698–709, October 1967.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1970 Springer-Verlag
About this paper
Cite this paper
Kowalski, R. (1970). The case for using equality axioms in automatic demonstration. In: Laudet, M., Lacombe, D., Nolin, L., Schützenberger, M. (eds) Symposium on Automatic Demonstration. Lecture Notes in Mathematics, vol 125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060628
Download citation
DOI: https://doi.org/10.1007/BFb0060628
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04914-2
Online ISBN: 978-3-540-36262-3
eBook Packages: Springer Book Archive
