Abstract
This article is the eighth of a series of articles discussing various open research problems in automated reasoning. Here we focus on self-analysis and the weighting strategy. The problem proposed for research asks one to find a means for an automated reasoning program to self-analytically determine which weights or priorities to give to clauses at various points during the program's attempt to complete a given assignment. For evaluating a proposed solution to this research problem, we include suggestions concerning possible test problems.
Similar content being viewed by others
References
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).
McCharen, J., Overbeek, R., and Wos, L., ‘Complexity and related enhancements for automated theorem-proving programs’, Computers and Mathematics with Applications 2, 1–16 (1976).
Robinson, J., ‘Automatic deduction with hyper-resolution’, International Journal of Computer Mathematics, 1, 227–234 (1965).
Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1987).
Wos, L., ‘Basic research problems: The problem of self-analytically choosing the set of support’, J. Automated Reasoning 4, 327–330 (1988).
Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications, Prentice-Hall, Englewood Cliffs, New Jersey (1984).
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 self-analytically choosing the weights. J Autom Reasoning 4, 463–464 (1988). https://doi.org/10.1007/BF00297250
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00297250