This article is the fifteenth of a series of articles discussing various open research problems in automated reasoning. Here we focus on finding a strategy — other than a simple syntactic one — that can be used for focusing the attention of the inference rule(s) in use. The problem proposed for research asks one to find semantic criteria for selecting the clauses needed to complete the application of an inference rule. Suggestions for test problems are included. We note that Yuan Yu has solved two of these problems using a rather different approach with the Boyer-Moore theorem prover; his work is reported elsewhere in this issue of the Journal of Automated Reasoning.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Boyer, R. and Moore, J., A Computational Logic, Academic Press, New York (1979).
McCharon, J., Overbeek, R., and Wos, L., ‘Complexity and related enhancements for automated theorem-proving programs’, Computers and Mathematics with Applications 2, 1–16 (1976).
Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1987).
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.
About this article
Cite this article
Wos, L. The problem of finding a semantic strategy for focusing inference rules. J Autom Reasoning 6, 337–339 (1990). https://doi.org/10.1007/BF00244492
- Automated reasoning
- semantic criteria
- syntactic criteria
- inference rules
- unsolved research problem