Affiliation:
1. Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, Illinois 60439, USA
Abstract
In the beginning (the early 1960s), the long-term goal of automated reasoning (although the field at the time was not known by that name) was the design and implementation of a program whose use would lead to "real" and significant contributions to mathematics by offering sufficient power for the discovery of proofs. The realization of that goal appeared to be at least six decades in the future. However, with amazement and satisfaction, we can report that fewer than four decades were required. In this article, we present evidence for this claim, thanks to W. McCune's program OTTER. Our focus is on various landmarks, or milestones, of two types. One type concerns the formulation of new strategies and methodologies whose use greatly enhances the power of a reasoning program. A second type focuses on actual contributions to mathematics and (although not initially envisioned) to logic. We give examples of each type of milestone, and, perhaps of equal importance, demonstrate that advances are far more likely to occur if the two classes are closely intertwined. We draw heavily on material presented in great detail in the new book Automated Reasoning and the Discovery of Missing and Elegant Proofs, published by Rinton Press.
Publisher
World Scientific Pub Co Pte Lt
Subject
Artificial Intelligence,Artificial Intelligence
Reference19 articles.
1. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
2. A. Tarski and J. Łukasiewicz, Logic, Semantics, Metamathematics, eds. A. Tarski and J. H. Woodger (Clarendon Press, Oxford, 1956) pp. 38–59.
3. Fragments of many-valued statement calculi
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On Transfinite Knuth-Bendix Orders;Lecture Notes in Computer Science;2011
2. Axiomatizing the Skew Boolean Propositional Calculus;Journal of Automated Reasoning;2006-09-22