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
Kowalski, R., and Hayes, P. "Semantic trees in automatic theorem proving," Machine Intelligence IV, ed by Michie and B. Meltzer (1969).
Luckham, D. "Some tree-paring strategies for theorem-proving." Machine Intelligence III, ed. by M. Michie, Edinburgh Univ. Press, Edinburgh (1968).
Robinson, A. Model theory and the mathematics of algebra. North Holland, Amsterdam (1963).
Robinson, G., and Wos, L. "Paramodulation and theorem-proving in first-order theories with equality." Machine Intelligence IV, ed. by D. Michie and B. Meltzer (1969).
Robinson, J. "A machine-oriented logic based on the resolution principle." J.ACM 12 (1965), pp. 23–41.
Slagle, J. "Automatic theorem proving with renumerable and semantic resolution." J. ACM 14 (1967), pp. 687–697.
Suppes, P. Introduction to Logic, Prentice Hall, New York (1957).
Wos, L., Carson, D., and Robinson, G. "The unit preference strategy in theorem proving." AFIPS Conf. Proc. 26, Spartan Books, Washington D. C. (1964), pp. 615–621.
Wos, L., Robinson, G., and Carson, D. "Efficiency and completeness of the set of support strategy in theorem proving." J. ACM 12 (1965), pp. 536–541.
Wos, L., Robinson, G., Carson, D., and Shalla, L. "The concept of demodulation in theorem proving." J. ACM 14 (1967) pp. 698–709.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1970 Springer-Verlag
About this paper
Cite this paper
Robinson, G., Wos, L. (1970). Axiom systems in automatic theorem proving. 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/BFb0060635
Download citation
DOI: https://doi.org/10.1007/BFb0060635
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
