Abstract
This article is the fourth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research focuses on finding criteria that would enable an automated reasoning program to expand or contract definitions wisely. For evaluating a proposed solution to this research problem, we include suggestions concerning possible test problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boyer, R., Lusk, E., McCune, W., Overbeek, R., Stickel, M., and Wos, L., ‘Set theory in first-order logic: clauses for Gödel's axioms’, J. Automated Reasoning 2, pp. 287–327 (1986).
Boyer, R., and Moore, J, A Computational Logic, Academic Press, New York (1979).
Gödel, K., The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis with the Axioms of Set Theory, Princeton University Press, Princeton (1940).
Hentzel, I., and Cattaneo, G., ‘Degree three identities’, Communications in Algebra 12, pp. 2349–2399 (1984).
Pokrass, D. J., and Rodabaugh, D. J., ‘On the nilpotency of generalized alternative algebras’, J. Algebra 49 (November 1977).
Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, NJ (1987).
Zhevlakov, K. A., Slin'ko, A. M., Shestakov, I. P., and Shirshov, A. I., Rings That Are Nearly Associative, Academic Press, New York (1982).
Author information
Authors and Affiliations
Additional information
This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, 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 definition expansion and contraction. J Autom Reasoning 3, 433–435 (1987). https://doi.org/10.1007/BF00247438
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00247438