Theory and foundations
AI milestones in theory and foundations, part of ai research.
21 milestones
DeepMind Technologies Founded
Demis Hassabis, Shane Legg, and Mustafa Suleyman co-founded DeepMind Technologies in London in 2010, establishing an independent research laboratory with the stated goal of developing general-purpose artificial intelligence grounded in neuroscience.
Elephants Don't Play Chess by Rodney Brooks
In 1990, Rodney Brooks of MIT's Artificial Intelligence Laboratory published 'Elephants Don't Play Chess' in Robotics and Autonomous Systems, arguing that classical symbolic AI was fundamentally misconceived and that intelligence emerges from direct physical interaction with the environment rather than from abstract symbol manipulation.
Rodney Brooks Publishes 'Elephants Don't Play Chess', Articulating Nouvelle AI
In 1990, Rodney Brooks of MIT published 'Elephants Don't Play Chess' in Robotics and Autonomous Systems, arguing that intelligent behaviour could emerge from direct sensorimotor coupling with the environment without internal symbolic representations, formalising the nouvelle AI research programme.
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference Published by Judea Pearl
In 1988, Judea Pearl of UCLA published Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference with Morgan Kaufmann, providing a systematic framework for representing and computing with uncertain knowledge using Bayesian networks and belief propagation algorithms.
Second AI Winter
From approximately 1987 to 1993, AI research entered a second sustained contraction as commercial expert-system vendors collapsed, the Lisp machine market failed, and DARPA substantially reduced funding for AI programmes following unmet expectations from the preceding boom.
Primal Sketch Theory of Early Visual Representation Described by David Marr
David Marr, working at MIT's Artificial Intelligence Laboratory, formalised the primal sketch as the first stage of his three-level theory of visual processing, published posthumously in 'Vision' (1982). The model proposed that the visual system constructs a symbolic, viewer-centred description of intensity changes and local geometry before any object recognition takes place.
John Searle Publishes the Chinese Room Argument
In 1980, John Searle at the University of California, Berkeley published 'Minds, Brains, and Programs' in Behavioral and Brain Sciences, presenting the Chinese Room thought experiment to argue that executing a computer program is insufficient to produce understanding or intentionality, directly challenging claims of strong artificial intelligence.
ABSTRIPS Developed by Earl Sacerdoti at SRI International
In 1974, Earl Sacerdoti at SRI International published ABSTRIPS, an extension of the STRIPS planning system that organised problem-solving into a hierarchy of abstraction spaces, allowing a planner to resolve high-level constraints before committing to fine-grained detail.
Human Associative Memory (HAM) Model Published by John R. Anderson and Gordon H. Bower
In 1973, John R. Anderson and Gordon H. Bower, both at Stanford University, published 'Human Associative Memory', introducing the HAM model, a propositional network architecture representing semantic memory as binary trees, providing a computationally explicit theory of human memory that influenced subsequent cognitive architectures.
Prolog Logic Programming Language Created by Alain Colmerauer and Philippe Roussel
In 1972, Alain Colmerauer and Philippe Roussel at the University of Aix-Marseille created Prolog (Programmation en Logique), a declarative programming language grounded in first-order predicate logic, enabling computers to reason over symbolic knowledge without requiring procedural step-by-step instructions.
Stanford Heuristic Programming Project founded by Edward Feigenbaum
In 1970, Edward Feigenbaum founded the Heuristic Programming Project (HPP) at Stanford University, establishing a dedicated research group to investigate the construction of knowledge-based expert systems and their application to scientific and medical domains.
Perceptrons: An Introduction to Computational Geometry
In 1969, Marvin Minsky and Seymour Papert of MIT published Perceptrons: An Introduction to Computational Geometry, a formal mathematical analysis of single-layer perceptrons that demonstrated key limitations, notably the inability to compute non-linearly separable functions such as XOR, and contributed to a reduction in funding and research activity in connectionist approaches to AI.
A* Search Algorithm Published by Hart, Nilsson, and Raphael at Stanford Research Institute
In 1968, Peter E. Hart, Nils J. Nilsson, and Bertram Raphael at the Stanford Research Institute published 'A Formal Basis for the Heuristic Determination of Minimum Cost Paths', introducing the A* search algorithm, which finds shortest paths in graphs efficiently by combining actual path cost with a heuristic estimate of remaining cost.
Analogy: A Program That Solves Geometric Analogy Problems by Thomas C. Evans
Thomas C. Evans, working at MIT, developed ANALOGY, a program capable of solving geometric analogy problems of the type found in standard IQ tests. First presented in dissertation form in 1963 and formally published in 1968, it demonstrated that a computer could perform a structured form of relational reasoning.
ELIZA Developed by Joseph Weizenbaum at MIT
In January 1966, Joseph Weizenbaum of MIT published a paper in Communications of the ACM describing ELIZA, a computer program that simulated conversation by applying pattern-matching rules to user input, and documented the unexpected tendency of human users to attribute understanding and empathy to the system.
Alchemy and Artificial Intelligence, RAND Corporation Memorandum by Hubert Dreyfus
In December 1965, Hubert Dreyfus, a philosopher at the Massachusetts Institute of Technology consulting for the RAND Corporation, published RAND Memorandum P-3244, 'Alchemy and Artificial Intelligence', arguing that the cognitive assumptions underlying contemporary AI research were philosophically untenable and that the field faced fundamental, not merely technical, limits.
Herbert A. Simon predicts machines will be capable of any work a human can do, within twenty years
In 1965, Herbert A. Simon of Carnegie Mellon University published 'The Shape of Automation for Men and Management', in which he predicted that machines would, within twenty years, be capable of performing any cognitive task a human could perform, a claim that became one of the most cited and scrutinised forecasts in the history of artificial intelligence.
Man-Computer Symbiosis, paper by J. C. R. Licklider
In March 1960, J. C. R. Licklider, then at Bolt Beranek and Newman, published 'Man-Computer Symbiosis' in IRE Transactions on Human Factors in Electronics, articulating a vision in which humans and computers would collaborate interactively in real time to solve problems neither could address alone.
General Problem Solver introduced by Newell, Shaw and Simon
In 1959, Allen Newell and Herbert A. Simon at the RAND Corporation and Carnegie Institute of Technology, with J. C. Shaw, presented the General Problem Solver, a computer program that separated problem-solving strategy from domain knowledge using means–ends analysis.
John McCarthy Coins the Term 'Artificial Intelligence' in the Dartmouth Conference Proposal
In 1955, John McCarthy of Dartmouth College, together with Marvin Minsky, Nathaniel Rochester, and Claude Shannon, submitted a proposal to the Rockefeller Foundation for a summer research workshop, introducing the term 'artificial intelligence' and framing machine intelligence as a formal field of scientific inquiry.
Programming a Computer for Playing Chess, Claude Shannon
In March 1950, Claude Shannon, then at Bell Telephone Laboratories, published 'Programming a Computer for Playing Chess' in Philosophical Magazine, outlining two strategic approaches, exhaustive search (Type A) and selective heuristic search (Type B), that framed computer chess research for decades.