Abstract
This article is the fourteenth of a series of articles discussing various open research problems in automated reasoning. Here we focus on the relationship between two approaches to the automation of reasoning: the paradigm based on the clause language and that based on natural deduction. The problem proposed for research asks one to find a mapping between the two approaches such that reasoning programs based on either approach perform identically on a specific assignment. 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.
References
Andrews, P., ‘Transforming matings into natural deduction proofs’, pp. 281–292 in Proceedings of the Fifth International Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, Vol. 87, ed. W.Bibel and R.Kowalski, Springer-Verlag, New York (1980).
Bledsoe, W. and Bruell, P., ‘A man-machine theorem proving system’, Artificial Intelligence 5, 51–72 (1974).
Wos, L., Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey (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 finding a mapping between clause representation and natural-deduction representation. J Autom Reasoning 6, 211–212 (1990). https://doi.org/10.1007/BF00245820
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00245820