Abstract
Along the line of the science of reasoning proposed by Alan Bundy [8], we present in this paper a computational theory accounting for human formal deductive competence. Our goal is primarily twofold. For one thing, it is aimed to establish an explanatory framework for human theorem proving. Devised as a computational theory, for another thing, it should also set up a theoretical foundation for deductive systems which simulate the way in which human beings carry out reasoning tasks. As such, the hope is to arrive at systems which learn and plan, which share their experiences with human users in high level communications. The last requirement, we believe, makes such systems ultimately useful. As a computational model, we cast the cognitive activities involved in theorem proving as an interleaving process of metalevel planning and object level verification. Within such a framework, emphasis is put on three kinds of tactics concerning three kinds of declarative knowledge structures. We also account for the acquisition of new tactics and methods, as well as the modifications of existing tactics and methods to suit novel problems. While the fundamental framework is sketched out formally, the mechanisms manipulating tactics and methods are only intended to be suggestive, achieved with the help of examples.
This work was supported by the Deutsche Forschungsgemeinschaft, SFB 3I4 (D2, D3)
Preview
Unable to display preview. Download preview PDF.
References
P. B. Andrews. Transforming Matings into Natural Deduction Proofs. LNCS, 87, 1980.
P. B. Andrews. Theorem Proving via General Matings. JACM, 28, 1981.
J. Bates. The architecture of prl: A mathematical medium. Technical Report CMU-CS-90-149, School of Computer Science, CMU, July 1990.
W. Bibel. Automated Theorem Proving. Vieweg, Braunschweig, 1983.
R. S. Boyer and J. S. Moore. A Computational Logic. Academic Press, 1979.
M. D. Braine. On the Relation Between the Natural Logic of Reasoning and Standard Logic. Psychological Review, 85(1), Jan 1978.
A. Bundy. The Use of Explicit Plans to Guide Inductive Proofs. In Proc. of 9th International Conference on Automated Deduction, 1988.
A. Bundy. A Science of Reasoning: Extended Abstract. In Proc. of 10th International Conference on Automated Deduction. Springer, 1990.
P. T. David Basin, Fausto Giunchiglia. Automating meta-theory creation and system extension. Technical Report DAI No. 543, Univ. of Edinburgh, 1991.
N. Eisinger and H. J. Ohlbach. The markgraf karl refutation procedure. In Lecture Notes in Comp. Sci., 230 (CADE 86), 1986.
R. L. C. et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, Inc., 1986.
G. Gentzen. Untersuchungen über das logische Schließen I. Math. Zeitschrift, 39, 1935.
X. Huang. Reference Choices in Mathematical Proofs. In Proc. of ECAI-90, L. C. Aiello (Ed). Pitman Publishing, 1990.
X. Huang. An Extensible Natural Calculus for Argument Presentation. Technical Report SEKI SR-91-3, Uni. Kaiserslautern, 1991.
X. Huang, M. Kerber, and M. Kohlhase. Theorem proving as a planning and verification process. Technical Report to appear as SEKI Report, Uni. des Saarlandes, 1992.
P. Johnson-Laird. Mental Models. Harvard Univ. Press, Cambridge, Massachusetts, 1983.
P. Johnson-Laird and R. Byrne. Deduction. Ablex Publishing Corporation, 1990.
M. Kerber. On the representation of mathematical knowledge in frames and its consistency. In WOCFAI '91, 1991.
G. Lakoff. Linguistics and natural logic. Syntheses, 22, 1970.
A. Newell. Unified Theories in Cognition. Harvard University Press, Cambridge, MA, 1990.
L. C. Paulson. Logic and Computation. Cambridge university Press, 1987.
L. J. Rips. Cognitive Processes in Propositional Reasoning. Psychological Review, 90, 1983.
J. Robinson. A machine-oriented logic based on the resolution principle. J. of ACM, 12, 1965.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, X. (1993). An explanatory framework for human theorem proving. In: Jürgen Ohlbach, H. (eds) GWAI-92: Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018992
Download citation
DOI: https://doi.org/10.1007/BFb0018992
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56667-0
Online ISBN: 978-3-540-47626-9
eBook Packages: Springer Book Archive