Abstract
This article is the twentieth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria for effectively choosing between using and avoiding equality predicates. Since there exist inference rules (such as paramodulation) that enable an automated reasoning program to treat equality as ‘understood’, the discovery of such criteria would mark an important advance for the field. For evaluating a proposed solution to this research problem, we suggest possible test problems from group theory, ring theory, and Boolean algebra.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Guard, J., Oglesby, F., Bennett, J., and Settle, L., ‘Semi-automated mathematics’, Journal ACM 16, 49–62 (1969).
Lusk, E., and Overbeek, R., The Automated Reasoning System ITP, Technical Report ANL-84-27, Argonne National Laboratory (April 1984).
McCune, W., OTTER 2.0 Users Guide, Technical Report ANL-90/9, Argonne National Laboratory, Argonne, Illinois, 1990.
McCune, W., What's New in OTTER 2.2. Mathematics and Computer Science Division Technical Report ANL/MCS-TM-153, Argonne National Laboratory, Argonne, Illinois, 1991.
Robinson, G., and Wos, L., ‘Paramodulation and theorem-proving in first-order theories with equality’, in B. Meltzer and D. Michie (eds), Machine Inntelligence 4, Edinburgh University Press, Edinburgh (1969), pp. 135–150.
Robinson, J., ‘Automatic deduction with hyper-resolution’, International J. Computer Mathematics 1, 227–234 (1965).
Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1987).
Wos, L., ‘The problem of choosing between predicate and function notation for problem representation’, J. Automated Reasoning 6, 463–464 (1990).
Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications, 2nd edn., McGraw-Hill, New York (1992).
Wos, L., and Robinson, G., ‘Maximal models and refutation completeness: Semidecision procedures in automatic theorem proving’, W. Boone, F. Cannonito, and R. Lyndon (eds), Word Problems: Decision Problems and the Burnside Problem in Group Theory, North-Holland, New York (1973).
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 using and avoiding equality predicates. J Autom Reasoning 8, 307–309 (1992). https://doi.org/10.1007/BF00244286
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00244286