Abstract
This article is the sixteenth of a series of articles discussing various open research problems in automated reasoning. Here we focus on choosing between the use of predicates and the use of functions for representing information to an automated reasoning program. The problem proposed for research asks one to find criteria that dictate the most effective choice of notation-functions or predicates-for presenting the question to be studied. The criteria must reflect the close coupling between inference rule, strategy, and representation. We suggest possible test problems for evaluating a proposed solution to this research problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Robinson J., ‘A machine-oriented logic based on the resolution pronciple’, J. ACM 12, 23–41 (1965).
Wos L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1987).
Wos L., ‘The problem of choosing the inference rule to employ’, J. Automated Reasoning 3, 201–209 (1987).
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 choosing between predicate and function notation for problem representation. J Autom Reasoning 6, 463–464 (1990). https://doi.org/10.1007/BF00244358
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00244358