The Automated Mathematician (AM) is one of the earliest successful discovery systems. It was created by Douglas Lenat in Lisp, and in 1977 led to Lenat being awarded the IJCAI Computers and Thought Award.
AM worked by generating and modifying short Lisp programs which were then interpreted as defining various mathematical concepts; for example, a program that tested equality between the length of two lists was considered to represent the concept of numerical equality, while a program that produced a list whose length was the product of the lengths of two other lists was interpreted as representing the concept of multiplication. The system had elaborate heuristics for choosing which programs to extend and modify, based on the experiences of working mathematicians in solving mathematical problems.
Lenat claimed that the system was composed of hundreds of data structures called "concepts," together with hundreds of "heuristic rules" and a simple flow of control: "AM repeatedly selects the top task from the agenda and tries to carry it out. This is the whole control structure!" Yet the heuristic rules were not always represented as separate data structures; some had to be intertwined with the control flow logic. Some rules had preconditions that depended on the history, or otherwise could not be represented in the framework of the explicit rules.
What's more, the published versions of the rules often involve vague terms that are not defined further, such as "If two expressions are structurally similar, ..." (Rule 218) or "... replace the value obtained by some other (very similar) value..." (Rule 129).
Another source of information is the user, via Rule 2: "If the user has recently referred to X, then boost the priority of any tasks involving X." Thus, it appears quite possible that much of the real discovery work is buried in unexplained procedures.
Lenat claimed that the system had rediscovered both Goldbach's conjecture and the fundamental theorem of arithmetic. Later critics accused Lenat of over-interpreting the output of AM. In his paper Why AM and Eurisko appear to work, Lenat conceded that any system that generated enough short Lisp programs would generate ones that could be interpreted by an external observer as representing equally sophisticated mathematical concepts. However, he argued that this property was in itself interesting—and that a promising direction for further research would be to look for other languages in which short random strings were likely to be useful.
One of the key concepts espoused by Lenat Which was learned from AM was the problem of limited knowledge. AM had a simple set of rules from which it could discover new concepts. But as time Drew on new discoverys became depleted.
This effect was confirmed on Eurisko and lead his interest in the “knowledge closure“ problem. It was envisioned that with a sufficiently complete set of knowledge rules that Human-like intelligence would be possible.
Although it seems even among natural intelligence that closure requires more knowledge than most people attain. This is explained by a guest student Sheridan as the reason why most elections are split 50-50. That, In fact almost no one ever reaches closure.
- Computer-assisted proof
- Automated theorem proving
- Symbolic mathematics
- Experimental mathematics
- HR (software) and Graffiti (program), related math discovery systems
- Ritchie, G. D.; Hanna, F. K. (August 1984), "AM: A case study in AI methodology", Artificial Intelligence, 23 (3): 249–268, doi:10.1016/0004-3702(84)90015-8.
- Lenat, D.B., (1976), AM: An artificial intelligence approach to discovery in mathematics as heuristic search, Ph.D. Thesis, AIM-286, STAN-CS-76-570, and Heuristic Programming Project Report HPP-76-8, Stanford University, AI Lab., Stanford, CA. available online at https://saltworks.stanford.edu/assets/druid:sb448rj9905.pdf[permanent dead link] Published in Knowledge-based systems in artificial intelligence along with Randall Davis's Ph.D. Thesis, McGraw-Hill, 1982.
- Lenat, Douglas B. (1977), "The Ubiquity of Discovery (Computers and Thought Lecture)", IJCAI (PDF), pp. 1093–1103, archived from the original (PDF) on 2014-08-06.
- Koza, John R. (1992), "9.3 AM and Euroski", Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, pp. 232–236, ISBN 9780262111706.
- Ritchie & Hanna (1984), pp. 256–257.
- Ritchie & Hanna (1984), p. 258.
- Ritchie & Hanna (1984), p. 252.
- Lenat, D. B., and Brown, J. S. (August 1984). "Why AM and EURISKO appear to work." Artificial Intelligence 23(3):269—294.
- Henderson, Harry (2007), "The Automated Mathematician", Artificial Intelligence: Mirrors for the Mind, Milestones in Discovery and Invention, Infobase Publishing, pp. 93–94, ISBN 9781604130591.
- Edmund Furse; Why did AM run out of steam?
- Ken Haase's Ph.D. Thesis; Invention and Exploration in Discovery, a rational reconstruction of Doug Lenat's seminal AM program and an analysis of the relationship between invention and exploration in discovery.
- open source Prolog claimed re-implementation of Lenat's AM available at https://github.com/akkartik/am-utexas