Abstract
This article is the thirtieth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks for criteria for accurately determining when an induction argument is the appropriate form of argument for an automated reasoning program to employ. This research problem also asks for criteria for choosing well the property on which to conduct the induction argument.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Boyer, R., and Moore JA Computational Logic, Academic Press, New York (1979).
Boyer, R., and Moore J ‘A mechanical proof of the unsolvability of the halting problem’,Journal of the ACM 31 (1984), 441–458.
Boyer, R., and Moore J ‘Proof checking the RSA public key encryption algorithm’,American Mathematical Monthly 91 (1984), 181–189.
Boyer, R., and Moore J ‘Proof-checking, theorem-proving, and program verification’, pp. 119–132 inContemporary Mathematics, Vol. 29, Automated Theorem Proving: After 25 Years, (W. Bledsoe and D. Loveland, eds), American Mathematical Society, Providence, R.I. (1984).
McCune, W. W.,OTTER 2.0 Users Guide, Tech. report ANL-90/9, Argonne National Laboratory, Argonne, Illinois (1990).
Wos, L.,Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, N.J. (1988).
Wos, L., Overbeek, R., Lusk, E., and Boyle, J.,Automated Reasoning: Introduction and Applications, 2nd edn., McGraw-Hill, New York (1992).
Author information
Authors and Affiliations
Additional information
This work was supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.
Rights and permissions
About this article
Cite this article
Wos, L. The problem of induction. J Autom Reasoning 11, 433–434 (1993). https://doi.org/10.1007/BF00881876
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00881876