The history of symbolic AI: from Dartmouth to neuro-symbolic

Symbolic AI is the branch of artificial intelligence that represents knowledge as explicit symbols, rules and logic, and reasons by manipulating them. Its history begins with the 1956 Dartmouth workshop and runs through the Logic Theorist, LISP, expert systems, two AI winters and knowledge graphs to today’s neuro-symbolic systems.

1. What symbolic AI is, and where its history starts

Symbolic AI (also called classical AI, logic-based AI or, after 1985, GOFAI) builds intelligence from representations a person can read: symbols that stand for things (patient, block-A, benzene), structures that relate them (rules, frames, logical formulas, graphs), and procedures that manipulate those structures (search, inference, planning). Its opposite number is the sub-symbolic or connectionist tradition, which learns numerical weights from data and whose best-known form is the neural network. The pillar page What is symbolic AI? covers the ideas; this page covers the history.

The ideas are older: formal logic, computability, and Turing’s 1950 question “Can machines think?” [1]. But the research programme that treated thinking as symbol manipulation, and set out to build it, began with the Dartmouth proposal of 1955 and its workshop in 1956.

2. The full timeline, 1950–2025

Every row below was checked against a primary source or a standard reference; the references are numbered in §13.

3. The founding era, 1950–1965

Turing’s question

In October 1950 Alan Turing published “Computing Machinery and Intelligence” in the philosophy journal Mind [1]. He replaced the question “Can machines think?” with a behavioural test, the imitation game. The paper proposed no method; it made the question respectable.

Dartmouth and the name

On 31 August 1955 John McCarthy, Marvin Minsky, Nathaniel Rochester and Claude Shannon submitted a proposal for “a 2 month, 10 man study of artificial intelligence” to be held at Dartmouth College in the summer of 1956 [2]. The proposal introduced the phrase “artificial intelligence”, and it states the founding conjecture of the field: “every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it.” The workshop produced no single result; it gathered the people who would lead AI for two decades.

The Logic Theorist and GPS

Working at the RAND Corporation in 1955–56, Allen Newell, Cliff Shaw and Herbert Simon built the Logic Theorist, often described as the first AI program [3]. It proved theorems of propositional logic by searching backward from the goal with heuristics, and it proved 38 of the first 52 theorems in chapter 2 of Whitehead and Russell’s Principia Mathematica, finding a shorter proof of theorem 2.85 than the one in the book. Their next program, the General Problem Solver (created in 1957, reported in 1959), generalised the method as means–ends analysis: compare the current state with the goal, pick an operator that reduces the difference, and recurse [4]. GPS set a pattern that lasted: a general reasoning engine, separate from the domain knowledge it runs on.

LISP and logic as representation

In 1958 McCarthy, by then at MIT, began LISP. His 1960 paper presented it both as a working language and as a mathematical formalism [5]. Programs and data share one form, the list, so a LISP program can build and inspect other programs. That property made LISP the language of symbolic AI until the late 1980s.

The same year McCarthy presented “Programs with Common Sense” at a symposium at the National Physical Laboratory in Teddington, England (published 1959) [6]. It proposed the Advice Taker, a program that would hold its knowledge as sentences of formal logic and act on what it could deduce. It is the root of logic-based knowledge representation.

4. The golden age and the first programs, 1965–1973

The late 1960s produced the programs that still define symbolic AI in textbooks. Each worked, and each showed a limit.

• DENDRAL (from 1965). At Stanford, Edward Feigenbaum, the geneticist Joshua Lederberg, the chemist Carl Djerassi and Bruce Buchanan built a program that inferred the structure of organic molecules from mass-spectrometry data [8]. Its power came less from clever search than from encoded chemistry. The project’s lesson became a slogan, “knowledge is power”, and DENDRAL is usually called the first expert system.
• ELIZA (1966). Joseph Weizenbaum’s program at MIT matched keywords in typed input and transformed the sentence by rule [7]. With its DOCTOR script, which imitated a Rogerian psychotherapist, users attributed understanding to a program that had none.
• SHRDLU (1968–70). Terry Winograd’s MIT thesis program held English conversations about a simulated table of blocks, carried out commands and explained what it had done [11]. It was impressive inside its micro-world and could not be extended beyond it.
• STRIPS (1971). Richard Fikes and Nils Nilsson at SRI built a planner for Shakey, a mobile robot [12]. STRIPS described each action by its preconditions and its effects, lists of facts to add and delete. That representation still underlies AI planning.

Two 1969 publications shaped what came next. Minsky and Papert’s Perceptrons proved that single-layer perceptrons cannot compute functions such as XOR [9]. The book is widely held to have contributed to a sharp decline in neural-network research during the 1970s, although historians still argue about how much of the decline it caused; multi-layer networks trained by backpropagation later removed the limitation. The same year, McCarthy and Patrick Hayes named the frame problem: when a program reasons in logic about actions, how does it represent everything an action leaves unchanged without writing an axiom for each fact [10]?

In 1972, in Marseille, Alain Colmerauer and Philippe Roussel created Prolog (programmation en logique), drawing on Robert Kowalski’s procedural reading of Horn clauses [13]. A Prolog program is a set of facts and rules; running it is asking a question and letting resolution search for a proof. At Stanford in the same period, Edward Shortliffe’s MYCIN used a few hundred if-then rules with certainty factors to recommend antibiotics for blood infections and meningitis [14]. In a blinded evaluation its recommendations were judged as appropriate as those of Stanford’s infectious-disease experts, yet it was never used in routine clinical practice, because of integration, legal and ethical obstacles.

5. The first AI winter

The early programs were built on toy problems: a table of blocks, a page of logic, a small puzzle. Researchers expected them to scale. They did not, and the reason has a name.

With $b=10$ and $d=10$ that is about 1.1 × 10¹⁰ nodes; one more step multiplies it by ten. A toy world keeps $b$ and $d$ small. The real world does not. Heuristics cut the tree, but good heuristics turned out to be specific to each domain, and writing them was expensive.

In 1973 the UK Science Research Council published Artificial Intelligence: A General Survey by the mathematician Sir James Lighthill [15]. Lighthill judged that work on general-purpose AI had not delivered on its promises and pointed to combinatorial explosion as the reason methods that worked on small problems failed on large ones. Support for AI research at most British universities was cut; only a few centres, Edinburgh among them, kept substantial programmes. In the United States, the 1969 Mansfield Amendment had already pushed DARPA toward mission-directed research, and in 1974 DARPA cancelled its speech-understanding contract with Carnegie Mellon [21]. The period from about 1974 to 1980 is now called the first AI winter.

Some durable ideas date from this winter. In 1974 Minsky circulated “A Framework for Representing Knowledge” (MIT AI Memo 306), proposing frames: structures for stereotyped situations with slots, default values and expectations [16]. Frames influenced later object-oriented and ontology languages. And in their 1975 Turing Award lecture, published in 1976, Newell and Simon stated the programme’s central claim as a testable hypothesis [17]:

Necessary means that anything intelligent is a symbol system; sufficient means that a symbol system of the right kind can be intelligent. The second half is the bet symbolic AI made. The first half is the part the neural tradition disputes. The companion page on symbolic systems covers the hypothesis in detail.

6. The expert-systems boom, 1980–1987

The way out of the first winter was to give up on generality. DENDRAL and MYCIN had shown that a narrow domain plus a lot of encoded expert knowledge could match specialists. In the 1980s that lesson became an industry.

The emblem of the boom was R1, known inside Digital Equipment Corporation as XCON. John McDermott at Carnegie Mellon wrote it as a production-rule system in OPS5 to configure VAX computer orders [18]. It went into use at DEC’s plant in Salem, New Hampshire, in 1980, and by contemporary estimates saved the company tens of millions of dollars a year. A market grew around the tools: expert-system shells, and Lisp machines, workstations built by firms such as Symbolics and LISP Machines Inc. to run LISP fast.

Governments followed. In 1982 Japan’s Ministry of International Trade and Industry launched the Fifth Generation Computer Systems project, run by a new institute, ICOT, to build parallel “inference machines” with logic programming at their core [19]. The United States answered with DARPA’s Strategic Computing Initiative in 1983 [37]. In July 1984 Douglas Lenat began Cyc at the Microelectronics and Computer Technology Corporation (MCC) in Austin, an effort to hand-encode the common-sense knowledge that expert systems lacked [20]. Cyc continued after MCC as Cycorp.

The warnings came from inside the field. At the 1984 AAAI annual meeting Roger Schank and Marvin Minsky, who had lived through the 1970s, warned that enthusiasm had outrun results and that a collapse would follow; the name they used, AI winter, stuck [21]. A year later the philosopher John Haugeland gave the whole classical approach a name in Artificial Intelligence: The Very Idea: GOFAI, “Good Old-Fashioned Artificial Intelligence”, the view that intelligence is internal, automatic symbol manipulation [22].

7. The second AI winter

The collapse started with hardware. In 1987 the market for Lisp machines fell apart: general-purpose workstations from companies such as Sun Microsystems ran LISP well enough at a fraction of the price, and a specialised industry lost its reason to exist within about a year [21]. The software problems were deeper and took longer to show.

• Brittleness. Expert systems performed well inside their domain and failed abruptly just outside it. They could not tell when a case was beyond their knowledge. A rule base does not degrade gracefully; it gives a confident answer or none.
• The knowledge-acquisition bottleneck. Every rule had to be elicited from an expert and written by a knowledge engineer. Large rule bases were expensive to build and harder still to keep consistent as they grew.
• Common sense. Systems lacked the background knowledge any person brings to a problem. Cyc, still under construction decades later, showed how large that gap was.
• Overpromising. Governments and companies had been sold general machine intelligence on a decade’s timescale. DARPA’s information-processing office cut AI funding sharply from 1987 [37]. Japan’s Fifth Generation project ended in 1992 short of its original goals, although it advanced concurrent logic programming [19].

A philosophical critique landed in the same years. In 1990 Stevan Harnad published “The Symbol Grounding Problem” [23]: how can the meaning of a formal symbol be intrinsic to the system, rather than parasitic on the meanings in our heads? His analogy was learning Chinese from a Chinese–Chinese dictionary alone. Harnad’s own proposal was a hybrid, with symbols grounded in learned sensory categories, which makes the paper an early argument for what is now called neuro-symbolic AI.

The second winter is usually dated from 1987; estimates of its end run from 1993 to 2000. As in the first winter, the work continued under other names.

8. Quiet infrastructure: search, logic programming, knowledge graphs

After 1990, much symbolic AI stopped being called AI. It became parts of ordinary computing.

Search: Deep Blue, 1997

In May 1997 IBM’s Deep Blue beat the world chess champion Garry Kasparov 3½–2½ in a six-game rematch in New York, having lost their first match 4–2 in February 1996 [24]. Deep Blue did not learn chess in the modern sense. It combined massively parallel game-tree search with an evaluation function designed by its engineers and computed in custom chess hardware, examining about 200 million positions per second. It is the best-known victory of search plus hand-built knowledge, and it was symbolic AI in everything but branding.

Logic, planning and verification

Logic programming, constraint solving, SAT and SMT solvers, automated planners descended from STRIPS, and theorem provers kept improving through the 1990s and 2000s. They moved into chip verification, scheduling, compilers, type checkers and databases. Rule engines kept running in banking, insurance and compliance.

The Semantic Web and knowledge graphs

In May 2001 Tim Berners-Lee, James Hendler and Ora Lassila described the Semantic Web in Scientific American: web content annotated with machine-readable meaning, so that software could reason over it [25]. The W3C standardised the pieces, including RDF and, on 10 February 2004, OWL, the Web Ontology Language, whose formal semantics come from description logic [26]. The full vision of a reasoning web did not arrive, but the parts did: ontologies in medicine and biology, linked open data, and structured markup in web pages.

On 16 May 2012 Google introduced its Knowledge Graph under the headline “things, not strings”: search results backed by a graph of entities and relations, drawn in part from Freebase and Wikipedia [27]. A large symbolic knowledge base had become part of one of the most used pieces of software in the world, and few users thought of it as AI.

9. The deep learning era, and why symbolic ideas never left

The same year, 2012, brought AlexNet. Alex Krizhevsky, Ilya Sutskever and Geoffrey Hinton trained a deep convolutional network on GPUs and won the ImageNet challenge with a top-5 error rate of 15.3%, against 26.2% for the next entry [28]. Within a few years deep learning dominated vision, speech and then language, the areas where symbolic AI had been weakest because the knowledge cannot easily be written down.

Symbolic methods did not disappear. They moved to where a learned model is not enough: where exactness matters (arithmetic, code execution, database queries, formal proof), where knowledge changes (a fact in a graph is corrected in one place, while a fact spread across weights cannot be edited that way), where decisions must be audited (a rule can be read and challenged; a weight cannot), and where look-ahead search still pays, as in games, planning and theorem proving.

The neural systems also rediscovered old symbolic failure modes in new form. A language model that answers confidently outside what it knows is showing the brittleness of the expert systems, from the other side: the expert system refused to generalise, the language model generalises without knowing when to stop. Neither knows where its knowledge ends.

10. The neuro-symbolic revival, 2016–2026

The most visible AI results since 2016 have often been hybrids. Neuro-symbolic AI has its own page; the historical outline is short.

• AlphaGo (2016). DeepMind’s program beat Lee Sedol 4–1 in Seoul in March 2016 [29]. It is often described as a deep-learning result; it is also a search program: Monte Carlo tree search guided by a policy network that proposes moves and a value network that judges positions.
• Naming the field (2020). In December 2020 Artur d’Avila Garcez and Luis Lamb posted “Neurosymbolic AI: The 3rd Wave” [30]. In February 2020 Henry Kautz gave the AAAI Robert S. Engelmore Memorial Lecture, “The Third AI Summer”, published in AI Magazine in 2022, which reviewed the two earlier boom-and-bust cycles and proposed a taxonomy of six ways to combine neural and symbolic components [31].
• Language models calling symbolic tools (2023–2026). Toolformer showed a language model teaching itself when to call a calculator, search engine or calendar [32]. Logic-LM had the model translate a problem into a formal representation and handed it to a deterministic solver [33]. Calling code interpreters, solvers, databases and knowledge graphs is now routine in deployed language-model systems.
• AlphaGeometry (January 2024). A language model trained on synthetic data proposes auxiliary constructions; a symbolic deduction engine does the proof. It solved 25 of 30 recent olympiad geometry problems, against 10 for the previous best method [34].
• AlphaProof and AlphaGeometry 2 (July 2024). Together they solved four of six problems at the 2024 International Mathematical Olympiad, 28 of 42 points, the silver-medal standard [35]. AlphaProof’s proofs were written in Lean, a formal language whose checker guarantees correctness. The problems were translated into Lean by hand, and some took up to three days to solve.

The boundary keeps moving, and an honest history has to say so. In July 2025 Google DeepMind reported that an advanced Gemini Deep Think model reached the gold-medal standard, 35 of 42, working end-to-end in natural language within the contest time limit and without a formal prover [36]. What has not changed is the value of a check: a Lean proof is correct because a small, trusted program verified it, not because the model that wrote it is usually right. That division of labour, a learned model that proposes and a symbolic procedure that verifies, is the most durable idea of the revival.

11. What the history teaches

Two booms ended in winters. The causes are well documented, and they are not specific to symbols.

The practical lesson is not “symbolic good, neural bad” or the reverse. It is that a system should know where its knowledge ends and should fail safely when it gets there. The expert systems of the 1980s had no reliable way to recognise a case outside their knowledge. Much of today’s AI has the same gap.

That is the design problem Perslis Research works on. A fail-safe model is an AI model built so that when it fails, the failure drives it toward a controlled, safe state: it abstains when evidence is missing, and its learning can narrow what it does but never widen what it is allowed to do. Peel, a research prototype, is to our knowledge the first fail-safe model. It keeps the symbolic half of this history where it is strongest: there is no neural network in the loop that decides, knowledge is typed, sourced cards, and learning is readable counts. A model may propose; only the floor admits a fact. How Perslis uses symbolic methods is described on Symbolic AI at Perslis, and why multi-step chains need a symbolic layer is argued in The Orchestration Gap. For the deterministic pipelines that connect these pieces, see symbolic flows.

Every technique, explained. From A* and alpha–beta to Rete, STRIPS, description logics and CDCL: the symbolic AI techniques guide covers more than 130 methods across ten families.

12. Questions

When did symbolic AI start?

In 1955 and 1956. The Dartmouth proposal of 31 August 1955 by John McCarthy, Marvin Minsky, Nathaniel Rochester and Claude Shannon introduced the term artificial intelligence, the Dartmouth workshop followed in summer 1956, and Newell, Shaw and Simon completed the Logic Theorist, often called the first AI program, the same year.

What caused the AI winters?

Promises outran results. The first winter, roughly 1974 to 1980, followed the 1973 Lighthill report and US funding cuts, after early programs failed to scale beyond toy problems. The second began in 1987 with the collapse of the Lisp machine market, as expert systems proved brittle and costly to maintain and large government programmes fell short.

What was the first expert system?

DENDRAL, begun at Stanford in 1965 by Edward Feigenbaum, Joshua Lederberg, Carl Djerassi and Bruce Buchanan, is usually called the first expert system. It inferred the structure of organic molecules from mass-spectrometry data. MYCIN, for infectious diseases, and R1/XCON, for configuring DEC computers, followed.

What is GOFAI?

GOFAI stands for Good Old-Fashioned Artificial Intelligence. The philosopher John Haugeland coined the term in his 1985 book Artificial Intelligence: The Very Idea for the classical view that intelligence consists of internal, automatic manipulation of symbols. Today it is used as a near-synonym for classical symbolic AI.

Was Deep Blue symbolic AI?

Largely, yes. Deep Blue, which beat Garry Kasparov in 1997, combined massively parallel game-tree search with an evaluation function designed by its engineers. It did not learn to play from data the way AlphaGo later did.

Is symbolic AI dead?

No. Symbolic methods run inside search engines, knowledge graphs, databases, planners, solvers and theorem provers, and many strong recent AI systems are hybrids, such as AlphaGo and AlphaGeometry. What faded was the claim that symbols alone are enough.

What is neuro-symbolic AI?

Neuro-symbolic AI combines neural networks with symbolic reasoning, so that a learned model handles perception and proposals while symbolic components handle search, rules and verification. The term gained wide use after 2020, but the idea is older: Harnad proposed grounding symbols in learned categories in 1990.

13. References

1. A. M. Turing. Computing Machinery and Intelligence. Mind 59(236):433–460, 1950.
2. J. McCarthy, M. L. Minsky, N. Rochester, C. E. Shannon. A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence, August 31, 1955. Reprinted in AI Magazine 27(4), 2006. doi:10.1609/aimag.v27i4.1904.
3. A. Newell, H. A. Simon. The Logic Theory Machine: A Complex Information Processing System. IRE Transactions on Information Theory IT-2(3):61–79, 1956.
4. A. Newell, J. C. Shaw, H. A. Simon. Report on a General Problem-Solving Program. Proceedings of the International Conference on Information Processing, 256–264, 1959.
5. J. McCarthy. Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I. Communications of the ACM 3(4), 1960. doi:10.1145/367177.367199.
6. J. McCarthy. Programs with Common Sense. Proceedings of the Symposium on Mechanisation of Thought Processes, National Physical Laboratory, Teddington, 1958 (published 1959).
7. J. Weizenbaum. ELIZA: A Computer Program for the Study of Natural Language Communication between Man and Machine. Communications of the ACM 9(1):36–45, 1966.
8. R. K. Lindsay, B. G. Buchanan, E. A. Feigenbaum, J. Lederberg. DENDRAL: A Case Study of the First Expert System for Scientific Hypothesis Formation. Artificial Intelligence 61(2), 1993.
9. M. Minsky, S. Papert. Perceptrons: An Introduction to Computational Geometry. MIT Press, 1969.
10. J. McCarthy, P. J. Hayes. Some Philosophical Problems from the Standpoint of Artificial Intelligence. In Machine Intelligence 4, B. Meltzer and D. Michie (eds.), Edinburgh University Press, 1969.
11. T. Winograd. Procedures as a Representation for Data in a Computer Program for Understanding Natural Language. PhD thesis, MIT, 1971.
12. R. E. Fikes, N. J. Nilsson. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 2(3–4), 1971.
13. A. Colmerauer, P. Roussel. The Birth of Prolog. In History of Programming Languages II, ACM, 1996. doi:10.1145/234286.1057820.
14. B. G. Buchanan, E. H. Shortliffe (eds.). Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project. Addison-Wesley, 1984.
15. J. Lighthill. Artificial Intelligence: A General Survey. In Artificial Intelligence: A Paper Symposium, Science Research Council, 1973.
16. M. Minsky. A Framework for Representing Knowledge. MIT AI Laboratory Memo 306, 1974.
17. A. Newell, H. A. Simon. Computer Science as Empirical Inquiry: Symbols and Search. Communications of the ACM 19(3), 1976. doi:10.1145/360018.360022.
18. J. McDermott. R1: An Expert in the Computer Systems Domain. Proceedings of AAAI-80, 1980.
19. E. Feigenbaum, H. Shrobe. The Japanese National Fifth Generation Project: Introduction, Survey, and Evaluation. Future Generation Computer Systems 9(2):105–117, 1993.
20. D. B. Lenat. CYC: A Large-Scale Investment in Knowledge Infrastructure. Communications of the ACM 38(11), 1995.
21. D. Crevier. AI: The Tumultuous History of the Search for Artificial Intelligence. Basic Books, 1993. See also the survey article “AI winter”, Wikipedia, accessed 2026-09-26.
22. J. Haugeland. Artificial Intelligence: The Very Idea. MIT Press, 1985.
23. S. Harnad. The Symbol Grounding Problem. Physica D 42:335–346, 1990.
24. M. Campbell, A. J. Hoane Jr., F.-h. Hsu. Deep Blue. Artificial Intelligence 134(1–2):57–83, 2002; and IBM, Deep Blue, IBM History.
25. T. Berners-Lee, J. Hendler, O. Lassila. The Semantic Web. Scientific American 284(5):34–43, May 2001.
26. W3C. OWL Web Ontology Language Overview. W3C Recommendation, 10 February 2004.
27. A. Singhal. Introducing the Knowledge Graph: things, not strings. The Official Google Blog, 16 May 2012.
28. A. Krizhevsky, I. Sutskever, G. E. Hinton. ImageNet Classification with Deep Convolutional Neural Networks. NIPS, 2012.
29. D. Silver et al. Mastering the Game of Go with Deep Neural Networks and Tree Search. Nature 529:484–489, 2016. doi:10.1038/nature16961.
30. A. d’Avila Garcez, L. C. Lamb. Neurosymbolic AI: The 3rd Wave. arXiv:2012.05876, 2020; Artificial Intelligence Review, 2023.
31. H. Kautz. The Third AI Summer: AAAI Robert S. Engelmore Memorial Lecture. AI Magazine 43(1):105–125, 2022. doi:10.1002/aaai.12036.
32. T. Schick et al. Toolformer: Language Models Can Teach Themselves to Use Tools. arXiv:2302.04761, 2023.
33. L. Pan, A. Albalak, X. Wang, W. Y. Wang. Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning. Findings of EMNLP, 2023.
34. T. H. Trinh, Y. Wu, Q. V. Le, H. He, T. Luong. Solving Olympiad Geometry without Human Demonstrations. Nature, January 2024. doi:10.1038/s41586-023-06747-5.
35. Google DeepMind. AI achieves silver-medal standard solving International Mathematical Olympiad problems. 25 July 2024.
36. Google DeepMind. Advanced version of Gemini with Deep Think officially achieves gold-medal standard at the International Mathematical Olympiad. 21 July 2025.
37. A. Roland, P. Shiman. Strategic Computing: DARPA and the Quest for Machine Intelligence, 1983–1993. MIT Press, 2002.