Abstract
This article is the twenty-eighth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria that an automated reasoning program can profitably use to remove functions present in the representation and replace them with appropriate predicates or constants thatname the entities that werenamed by the functions. The notation used to present a problem to a reasoning program can have a profound effect on the likelihood of the program's success.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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).
Overbeek, R., ‘An implementation of hyper-resolution’,Computers and Mathematics with Applications 1, 201–214 (1975).
Robinson, G. and Wos, L., ‘Paramodulation and theorem-proving in first-order theories with equality’, B. Meltzer and D. Michie (eds), inMachine Intelligence 4, Edinburgh University Press, Edinburgh (1969), pp. 135–150.
Wos, L.,Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1988).
Wos, L., Overbeek, R., Lusk, E., and Boyle, J.,Automated Reasoning: Introduction and Applications, 2nd edn., McGraw-Hill, New York (1992).
Wos, L., ‘Automated reasoning answers open questions’,Notices AMS 5, 15–26 (January 1993).
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 naming and function replacement. J Autom Reasoning 11, 147–148 (1993). https://doi.org/10.1007/BF00881903
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00881903