Editing Douglas Lenat (section)

==Research==
In 1976, Lenat received his [[Doctor of Philosophy|Ph.D.]] in Computer Science from [[Stanford University]], "AM: Discovery in mathematics as heuristic search" sponsored by [[DARPA|ARPA]].<ref>{{Cite thesis |last=Lenat |first=Douglas B. |title=AM, an artificial intelligence approach to discovery in mathematics as heuristic search |date=1976 |degree=PhD |url=https://apps.dtic.mil/sti/citations/ADA155378}} DTIC Accession Number: ADA155378</ref> It was republished as ''Knowledge-based systems in artificial intelligence'',<ref name="KBS" /> along with the Ph.D. thesis of Randall Davis, McGraw-Hill, 1982. His thesis advisor was Professor [[Cordell Green]].

His thesis, [[Automated Mathematician|AM (Automated Mathematician)]] was one of the first computer programs that attempted to make discoveries, i.e., to be a theorem ''proposer'' rather than a theorem ''prover''. Experimenting with the program fueled a cycle of criticism and improvement. Many issues had to be dealt with in constructing such a program: how to represent knowledge formally, expressively, and concretely, how to program hundreds of heuristic "interestingness" rules to judge the worth of new discoveries, heuristics for when to reason symbolically and inductively ''versus'' when to reason statistically from frequency data, what the architecture—the design constraints—of such reasoning programs might be, why heuristics work, and what their "inner structure" might be. AM was one of the first steps toward demonstrating that computer programs can make novel and creative discoveries.<ref name="DRS" />

In 1976, Lenat started teaching as an assistant professor of computer science at [[Carnegie Mellon]] and commenced his work on the AI program [[Eurisko]]. The limitation with AM was that it was locked into following a fixed set of interestingness heuristics; Eurisko, by contrast, represented its heuristic rules as first class objects and hence it could explore, manipulate, and discover new heuristics just as AM explored, manipulated, and discovered new domain concepts.{{cn|date=September 2023}}

Lenat returned to Stanford as an assistant professor of computer science in 1978 and continued his research building the Eurisko automated discovery and heuristic-discovery program. Eurisko made many interesting discoveries and enjoyed significant acclaim, with Lenat's paper "Heuretics: Theoretical and Experimental Study of Heuristic Rules"<ref name="Heur" /> winning the Best Paper award{{cn|date=September 2023}} at the 1982 [[Association for the Advancement of Artificial Intelligence|AAAI conference]].