Abstract
This article is the fifth of a series of articles discussing various open research problems in automated reasoning. Here we focus on the equality relation which is so vital to many applications of automated reasoning. The prolem proposed for research asks one to find a strategy for controlling the application of binary paramodulation. For evaluating a proposed solution to this research problem, we include suggestions concerning possible test problems.
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).
McCune W. and Wos L., ‘A case study in automated theorem proving: finding sages in combinatory logic’, J. Automated Reasoning 3, 91–107 (1987).
Peterson G. E., ‘A technique for establishing completeness results in theorem proving with equality’, SIAM J. Computing 12, 82–100 (1983).
Robinson G. and Wos L., ‘Paramodulation and theorem-proving in first-order theories with equality’, pp. 135–150 in Machine Intelligence 4, ed. B.Meltzer and D.Michie, Edinburgh University Press, Edinburgh (1969).
Robinson J., ‘A machine-oriented logic based on the resolution principle’, J. ACM 12, 23–41 (1965).
Smullyan R., To Mock a Mockingbird, Alfred A. Knopf, New York (1985).
Winker S. and Wos L., ‘Automated generation of models and counterexamples and its application to open questions in ternary Boolean algebra’, pp. 251–256 in Proc. Eighth International Symposium on Multiple-Valued Logic, IEEE and ACM, Rosemont, Illinois (1978).
Wos L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (1987).
Wos L. and McCune W., ‘Negative hyperparamodulation’, pp. 229–239 in Proc. Eighth International Conference on Automated Deduction, Lecture Notes in Computer Science, Vol. 230, ed. J.Siekmann, Springer-Verlag, New York (1986).
Wos L. and Robinson G., ‘Paramodulation and set of support’, pp. 276–310 in Proc. IRIA Symposium on Automatic Demonstration, Lecture Notes in Mathematics, Vol. 125, Springer-Verlag, New York (1970).
Wos L. and Robinson G., ‘Maximal models and refutation completeness: semidecision procedures in automatic theorem proving’, pp. 609–639 in Word Problems: Decision Problems and the Burnside Problem in Group Theory, eds. W.Boone, F.Cannonito, and R.Lyndon, North-Holland, New York (1973).
Wos L., Robinson G., Carson D., and Shalla L., ‘The concept of demodulation in theorem proving’, J. ACM, 14, 698–709 (1967).
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 finding a strategy to control binary paramodulation. J Autom Reasoning 4, 101–107 (1988). https://doi.org/10.1007/BF00244514
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00244514