- Atlas
- Computer Science
- Artificial Intelligence
Artificial Intelligence
Artificial intelligence (AI) is the project of making machines do things that, when people do them, we call intelligent: recognizing a face, understanding a sentence, proving a theorem, driving a car, playing chess.
11 frameworks, from 1956 to today · Artificial Intelligence · Computer Science
- Symbolic artificial intelligence 1956-1990
- Expert system 1970-1990
- Evolutionary Computation 1975-Present
- Bayesian network 1985-Present
- Reinforcement learning 1985-Present
- Behavior-based robotics 1986-2000
- Connectionism 1986-Present
- Statistical learning theory 1990-Present
- Neuro-symbolic AI 2005-Present
- Deep learning 2012-Present
- Large language model 2017-Present
Overview
Artificial intelligence (AI) is the project of making machines do things that, when people do them, we call intelligent: recognizing a face, understanding a sentence, proving a theorem, driving a car, playing chess1. What is at stake is not just automation but a question about the nature of thought itself. If a machine can reason, perceive, and learn, then intelligence may be a kind of computation rather than a special substance1. That idea has driven the field through cycles of optimism and disappointment, and it has produced techniques that now sit quietly inside search engines, translation apps, medical imaging, and the language models that write and answer questions. This is the story of how those techniques were invented, argued over, abandoned, and revived.
Symbolic AI and the Dartmouth founding
The field's conventional founding is a 1956 summer workshop at Dartmouth College, organized by John McCarthy, Marvin Minsky, Nathaniel Rochester, and Claude Shannon213. McCarthy coined the term "artificial intelligence" for the proposal24. The early researchers shared a conviction: intelligence is symbol manipulation15. A computer could be given a formal language in which to represent facts and rules, and a program could search through possible inferences to reach conclusions6.
This approach, later called symbolic AI or "good old-fashioned AI," produced striking early results17. In 1956 Allen Newell, J. C. Shaw, and Herbert Simon demonstrated the Logic Theorist, a program that proved theorems from Whitehead and Russell's Principia Mathematica, and in one case found a proof more elegant than the book's81. Their General Problem Solver (1957) tried to model human problem-solving as means–ends analysis: compare the current state with the goal, find the difference, and apply an operator that reduces it91. The programs worked on toy domains but revealed a core difficulty: the space of possible moves grows explosively, and general search without domain knowledge is hopeless1.
The countermeasure was to encode knowledge. John McCarthy's Lisp (1958) gave AI its own programming language, suited to manipulating symbolic expressions. In 1959 Arthur Samuel's checkers program learned to improve its play by adjusting weights on features of board positions, an early demonstration of machine learning. The 1960s also brought perceptrons: Frank Rosenblatt's 1958 device and its software versions, which learned to classify simple patterns by adjusting connection weights. The perceptron was a physical machine, the Mark I, and it captured the imagination of the press.
The first winter and the knowledge turn
Optimism outran results. In 1969 Marvin Minsky and Seymour Papert published Perceptrons, a rigorous analysis showing that single-layer perceptrons could not compute certain simple functions, such as exclusive-or, and that scaling them up was not straightforward. The book is often blamed for freezing neural-network research, though the deeper cause was that the symbolic paradigm dominated funding and prestige. In 1973 the British government's Lighthill Report concluded that AI had failed to deliver on its grand promises, and funding in Britain collapsed103. The period is remembered as the first "AI winter."10
The response was the expert system11. Instead of general reasoning, researchers encoded the specialized knowledge of human experts as rules11. Edward Feigenbaum at Stanford led the push. MYCIN, developed in the 1970s, diagnosed bacterial infections and recommended antibiotics using several hundred if–then rules, and in evaluations it performed comparably to human physicians. XCON, deployed at Digital Equipment Corporation from 1980, configured computer orders and saved the company substantial sums. Expert systems were a commercial boom in the early 1980s, and companies built "knowledge engineering" teams to interview experts and write rules.
The boom exposed the limits. Rules were expensive to elicit, brittle outside their narrow domain, and unable to handle uncertainty gracefully7. A rule that says "if fever and rash then measles" does not say how confident to be, and real diagnosis involves probabilities. The second AI winter arrived in the late 1980s as the expert-system market collapsed.
Uncertainty, probability, and Bayesian networks
The problem of reasoning under uncertainty had a mathematical answer that the field initially resisted. In the 1980s Judea Pearl developed Bayesian networks: graphical models in which nodes represent variables and directed edges represent conditional dependencies, so that a large joint probability distribution can be factored into manageable local pieces12. A Bayesian network for a medical domain can compute the probability of a disease given observed symptoms without enumerating every combination of variables12. Pearl's 1988 book Probabilistic Reasoning in Intelligent Systems made the case that probability was the right calculus for AI, against a tradition that had treated uncertainty as a nuisance. The approach spread into diagnosis, speech recognition, and later into machine learning, where graphical models became a standard tool.
Connectionism and the backpropagation revival
Meanwhile the neural approach returned. Connectionism is the view that intelligence emerges from networks of simple units connected by adjustable weights, rather than from explicit symbols. In 1986 David Rumelhart, Geoffrey Hinton, and Ronald Williams popularized backpropagation, an algorithm for training multilayer networks: compute the error at the output, then propagate it backward through the layers to adjust each weight in proportion to its contribution to the error. The key insight was that the chain rule of calculus lets a network with hidden layers learn internal representations that a single-layer perceptron could not. A network trained on examples of handwritten digits could learn to recognize new ones. The 1989 demonstration by Yann LeCun and colleagues of a convolutional network reading zip codes showed the approach could work on real problems.
Connectionism and symbolic AI competed for decades. Symbolists argued that networks could not represent structured knowledge or perform logical inference; connectionists argued that symbols had to be grounded in perception and learning. The debate was never fully settled, and it resurfaces today as neuro-symbolic AI, which combines neural learning with symbolic reasoning, for example by using a neural network to parse a scene and a symbolic planner to reason about it131.
Reinforcement learning and the agent framework
A third strand grew from the study of how agents learn by trial and error. Reinforcement learning formalizes this: an agent takes actions in an environment, receives rewards, and learns a policy that maximizes long-run reward14. The framework rests on the Bellman equation and dynamic programming, developed by Richard Bellman in the 1950s, and on the temporal-difference methods explored by Richard Sutton in the 1980s. Sutton and Andrew Barto's 1998 textbook consolidated the field. A landmark demonstration came in 1992, when Gerald Tesauro's TD-Gammon learned to play backgammon at a strong level by playing against itself, using temporal-difference learning and a neural network to evaluate positions. Reinforcement learning later became central to game-playing AI and to the training of large language models.
Behavior-based robotics
Robotics took a different turn. Classical AI robotics built a world model, planned a path, and executed it, which failed in messy real environments. In the late 1980s Rodney Brooks argued for behavior-based robotics: build robots from simple reactive layers, each responding directly to sensor input, with no central world model. His robot Genghis, a six-legged walker built in 1989, coordinated leg movements through simple reflexive rules and could climb over obstacles. The approach, sometimes called "Nouvelle AI," claimed that intelligence could emerge from the interaction of simple behaviors with the world, and it influenced later work on autonomous vehicles and drones.
Statistical learning theory and the probabilistic turn
By the 1990s the field had shifted toward statistics1. Statistical learning theory asks how a learner can generalize from finite data, and it supplied the mathematical scaffolding: the Vapnik–Chervonenkis (VC) dimension measures the capacity of a class of functions, and the bias–variance tradeoff explains why a model that fits training data too closely fails on new data. Vladimir Vapnik and Alexey Chervonenkis developed the core theory in the 1960s and 1970s; Vapnik's support vector machines, popularized in the 1990s, found wide use1516. The probabilistic turn also brought hidden Markov models into speech recognition and Bayesian methods into spam filtering and text classification. Machine learning became a discipline in its own right, with its own conferences and journals, and the boundary between AI and statistics blurred.
Deep learning
The decisive change came when neural networks got deep and data got big. Deep learning refers to networks with many layers, trained on large datasets with backpropagation and accelerated by graphics processing units (GPUs), which turned out to be well suited to the matrix arithmetic of neural nets. In 2012 Alex Krizhevsky, Ilya Sutskever, and Geoffrey Hinton won the ImageNet image-classification competition with a deep convolutional network, cutting the error rate dramatically and convincing the field that depth mattered. The ingredients were not new—convolutional networks dated to the 1980s, and backpropagation to the 1980s—but scale and computation made them work. Deep learning spread to speech recognition, translation, and game playing. In 2016 AlphaGo, built by DeepMind, defeated the Go champion Lee Sedol using deep networks combined with reinforcement learning and Monte Carlo tree search, a milestone because Go had long resisted brute-force search.
Large language models
The most recent turning point came from language. In 2017 a team at Google published the transformer architecture, which replaced recurrent networks with attention mechanisms that let a model weigh the relevance of every word in a sequence to every other. Transformers trained on vast text corpora produced large language models: systems with billions of parameters that learn statistical patterns of language and can generate, translate, summarize, and answer questions. GPT-3, released by OpenAI in 2020, showed that scaling up produced capabilities that smaller models lacked, and subsequent models became widely used tools. These systems descend from connectionism and statistical learning, and they raise open questions about reasoning, reliability, and how much of intelligence is captured by prediction from data.
Where the field stands
Today AI is a mix of traditions. Deep learning dominates perception and language; reinforcement learning drives game-playing and control; Bayesian methods handle uncertainty; symbolic methods persist in verification, planning, and knowledge representation; and neuro-symbolic hybrids try to combine them. The old debates—symbols versus networks, hand-crafted knowledge versus learned representations—have not been resolved so much as reframed by scale. The open questions are the ones the field began with: what it means for a machine to understand, how to make systems that generalize beyond their training, and whether the computational account of mind is the right one.
References
- Artificial intelligence (introduction, Computationalism and functionalism, History, Symbolic AI and its limits, State space search, Reasoning and problem-solving), Wikipedia
- Dartmouth workshop (introduction, Background), Wikipedia
- History of artificial intelligence, Wikipedia
- Dendral (History), Wikipedia
- Philosophy of artificial intelligence, Wikipedia
- Physical symbol system, Wikipedia
- Symbolic artificial intelligence, Wikipedia
- Logic Theorist, Wikipedia
- General Problem Solver, Wikipedia
- AI winter, Wikipedia
- Expert system, Wikipedia
- Bayesian network (introduction, History), Wikipedia
- Neuro-symbolic AI, Wikipedia
- Reinforcement learning, Wikipedia
- Vapnik–Chervonenkis theory, Wikipedia
- Support vector machine (History, introduction), Wikipedia
The frameworks of Artificial Intelligence
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1956-1990
Symbolic artificial intelligence
How can machines manipulate symbols to reason?
About Symbolic artificial intelligence
Symbolic AI, also called classical or logic-based AI, is the first coherent framework for building intelligent machines. It addresses a fundamental question: can intelligence be reduced to the manipulation of symbols according to formal rules? Its core claim is that thinking is a kind of computation over explicit, human-readable representations. This framework treats knowledge as a set of facts and rules, and reasoning as a search through a space of logical possibilities. Symbolic AI is distinct from later frameworks because it assumes that intelligence requires an explicit, internal model of the world, not just pattern recognition or statistical correlation.To understand Symbolic AI, a reader should first know that artificial intelligence aims to create systems that exhibit intelligent behavior. It also helps to have a basic sense of formal logic, such as the idea that statements can be true or false and that rules can connect them.The core curriculum for Symbolic AI begins with its central unit of analysis: the symbol. A symbol is a token that stands for something in the world, like 'cat' or 'temperature'. The framework's first teaching move is to understand knowledge representation, the problem of how to encode facts about the world in a machine-usable form. The canonical methods are logic (using formal languages like first-order predicate calculus), production rules (if-then statements), semantic nets (graphs of concepts and their relations), and frames (structured objects with slots for properties). The second move is search, the process of exploring possible sequences of actions or inferences to reach a goal. The third move is automated reasoning, using rules of inference to derive new conclusions from known premises. A key technique is resolution, a rule for proving theorems by refutation. The fourth move is planning, the task of finding a sequence of actions to achieve a goal, often using a means-ends analysis that compares the current state to the desired state. The fifth move is knowledge-based systems, also called expert systems, which encode domain-specific expertise in a knowledge base and use an inference engine to apply rules. The sixth move is symbolic machine learning, which includes methods like version space learning, decision tree learning (e.g., ID3), and inductive logic programming to acquire rules from examples. The seventh move is automated theorem proving, the use of a computer to prove mathematical theorems. The eighth move is constraint satisfaction, solving problems by finding values for variables that satisfy a set of constraints. The ninth move is ontologies, formal specifications of the concepts and relationships in a domain. The tenth move is explanation, the ability of a system to show the chain of reasoning that led to a conclusion.Symbolic AI emerged from the confluence of several intellectual currents in the midThe 13 concepts its tower teaches
- Automated Reasoning
- Constraint Satisfaction
- Frames
- Inference Engine
- Knowledge-Based Systems
- Logic
- Means-Ends Analysis
- Planning
- Production Rules
- Resolution
- Semantic Nets
- Symbol
- Symbolic Machine Learning
- 1970-1990
- 1975-Present
Evolutionary Computation
How can algorithms evolve solutions through selection?
- 1985-Present
- 1985-Present
- 1986-2000
Behavior-based robotics
How can simple reactive behaviors produce intelligent action?
- 1986-Present
Connectionism
How can networks of simple units learn representations?
About Connectionism
Connectionism offers a radical answer to the question of how machines can exhibit intelligent behavior: intelligence emerges from the collective activity of many simple, interconnected processing units, not from the manipulation of explicit symbols or rules. In artificial intelligence, this framework models cognitive processes as patterns of activation spreading across a network of neuron-like nodes, with learning occurring through the adjustment of connection strengths between them. This stands in sharp contrast to Symbolic AI, which treats intelligence as rule-governed symbol manipulation, and to Behavior-Based AI, which rejects internal representations altogether. Connectionism instead proposes that the architecture itself—the pattern of connections and their weights—is the locus of knowledge and the engine of learning.A first course in connectionism for artificial intelligence builds around a core set of concepts that define how these networks are structured, how they learn, and what they can represent. The curriculum begins with the artificial neuron as the fundamental processing unit, a simplified model of a biological neuron that computes a weighted sum of its inputs and applies an activation function to produce an output. These neurons are organized into network architecture, typically arranged in layers: an input layer, one or more hidden layers, and an output layer. The activation function—often a sigmoid or step function—determines whether a neuron fires, introducing the nonlinearity essential for learning complex patterns. Learning itself is driven by learning rules, procedures that adjust connection weights to reduce error. The most influential of these is backpropagation of error, which computes the gradient of the error function with respect to each weight and propagates corrections backward through the network. This process relies on gradient descent, an optimization method that iteratively moves weights in the direction that minimizes error. The network's ability to generalize from training data to unseen examples is captured by the concept of generalization, while the risk of memorizing noise rather than signal is known as overfitting. A network's representational power is described by its representational capacity, which grows with the number of hidden units and layers. The overall approach is often called parallel distributed processing, emphasizing that knowledge is not stored in a single location but is distributed across many connections. Two key phenomena illustrate the framework's strengths: graceful degradation, where damage to parts of the network leads to gradual rather than catastrophic loss of function, and pattern completion, where a partial input can reconstruct a stored pattern. Finally, the perceptron convergence theorem provides a foundational result: a single-layer perceptron can learn any linearly separable function, but its limitations—famously, its inability to learn XOR—motivated the shift to multilayer networks.Connectionism's intellectual history in artificial intelligence is marked by distinct waves, with the second wave (roughly 1986 to 1995) serving as the local dominant period. The first wave began in 1943 when Warren McCulloch and Walter Pitts showed that networks of simple threshold units could compute logical functions. Frank Rosenblatt's perceptron (1958) added a learning rule, sparking early excitement. But the 1969 book Perceptrons by Marvin Minsky and Seymour Papert rigorously analyzed the perceptron's limitations, particularly its inability to handle nonlinearly separable problems like XOR. This critique, combined with the dominance of Symbolic AI, led to a sharp decline in connectionist research funding and activity—the first 'AI winter' for the approach. The term 'connectionist model' was revived in a 1982 paper by Jerome Feldman and Dana Ballard, but the true renaissance came with the publication of Parallel Distributed Processing (1986) by David E. Rumelhart, James L. McClelland, and the PDP Research Group. This two-volume work introduced backpropagation of error as a practical learning algorithm for multilayer networks, demonstrated its power on a range of cognitive tasks, and articulated the philosophical implications of distributed representation. John Hopfield's 1982 work on Hopfield networks provided crucial mathematical foundations for understanding network dynamics and memory. During this second wave, connectionism was seen by many as a revolutionary alternative to Symbolic AI, sparking intense debates about whether it represented a fundamental shift in psychology and artificial intelligence. Key figures like Rumelhart, McClelland, and Geoffrey Hinton (who co-authored the influential 1986 backpropagation paper) drove this period. The framework coexisted with and was later supplemented by Probabilistic AI (from around 1988), which introduced Bayesian networks and probabilistic graphical models as alternative ways to handle uncertainty. Deep learning, beginning around 2006, can be seen as a third wave that scaled up connectionist ideas with deeper architectures, larger datasets, and more powerful hardware, leading to breakthroughs in image recognition, natural language processing, and game playing. Connectionism's legacy in AI is enduring: it established the core idea that learning from data through distributed representations is a viable path to intelligence, a principle that underpins much of modern machine learning.The 14 concepts its tower teaches
- Activation Function
- Artificial Neuron
- Backpropagation of Error
- Generalization
- Graceful Degradation
- Gradient Descent
- Hidden Layers
- Learning Rules
- Network Architecture
- Overfitting
- Parallel Distributed Processing
- Pattern Completion
- Perceptron Convergence Theorem
- Representational Capacity
- 1990-Present
Statistical learning theory
How can a learner generalize from finite data?
- 2005-Present
Neuro-symbolic AI
How can neural learning and symbolic reasoning be combined?
- 2012-Present
- 2017-Present
How the ideas connect
Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.
Expert system grew out of Symbolic artificial intelligence
Expert systems grew out of symbolic AI's conviction that intelligence is symbol manipulation, but replaced general search with domain-specific rules. Edward Feigenbaum led the shift, encoding expert knowledge as if-then rules in systems like MYCIN.
Carried by Edward Feigenbaum; MYCIN.
Behavior-based robotics reacted against Symbolic artificial intelligence
Behavior-based robotics defined itself against classical symbolic AI robotics, which built world models and planned. Rodney Brooks argued for reactive layers with no central representation.
Carried by Rodney Brooks.
Deep learning grew out of Connectionism
Deep learning is a direct descendant of connectionism, scaling up multilayer networks trained by backpropagation. The 1986 backpropagation revival made deep networks possible.
Carried by David Rumelhart; Geoffrey Hinton; Ronald Williams.
Large language model grew out of Deep learning
Large language models are deep learning architectures (transformers) scaled to massive text corpora. They are a direct outgrowth of the deep learning revolution.
Bayesian network reacted against Symbolic artificial intelligence
Bayesian networks arose as a response to symbolic AI's difficulty handling uncertainty. Judea Pearl argued that probability, not rules, was the right calculus for reasoning under uncertainty.
Carried by Judea Pearl.
Connectionism rival of Symbolic artificial intelligence
Connectionism and symbolic AI competed for decades over whether intelligence is symbol manipulation or emergent from networks. The debate was never fully settled.
Bayesian network reacted against Expert system
Bayesian networks were developed partly in response to expert systems' inability to handle uncertainty gracefully. Pearl's probabilistic approach offered a principled alternative to brittle if-then rules.
Carried by Judea Pearl.
Deep learning influenced by Reinforcement learning
Deep reinforcement learning combined neural networks with RL, as in TD-Gammon and later game-playing systems. The agent framework provided the training objective for deep networks.
Carried by Gerald Tesauro.
Large language model influenced by Reinforcement learning
Reinforcement learning from human feedback became central to training large language models, using reward models to fine-tune outputs. The RL framework supplied the optimization method.
Neuro-symbolic AI grew out of Connectionism
Neuro-symbolic AI grew out of connectionism's networks combined with symbolic reasoning, aiming to integrate learning and logic. It is a direct descendant of the connectionist tradition.
Deep learning influenced by Statistical learning theory
Statistical learning theory supplied the bias-variance tradeoff and generalization bounds that guided deep learning's regularization and evaluation. The mathematical scaffolding carried over.
Carried by Vladimir Vapnik.
Beyond the field
Where Artificial Intelligence's ideas came from in other fields, and what they led to there: the strongest 12 of 95 links.
Symbolic artificial intelligence provoked Chinese room in Philosophy Of Artificial Intelligence
Searle's Chinese room argument was framed directly against the claims of symbolic AI (GOFAI) that symbol manipulation constitutes understanding. He defined his position by rejecting the premise that a formal symbol system has semantics.
Carried by John Searle; Minds, Brains, and Programs (1980).
Symbolic artificial intelligence provoked Phenomenological Critique of AI in Philosophy Of Artificial Intelligence
The phenomenological critique of AI defined itself against symbolic AI's claim that intelligence is explicit rule-governed symbol manipulation. Dreyfus attacked the symbolic programme directly, arguing that everyday know-how cannot be formalised as rules.
Carried by Hubert Dreyfus; What Computers Can't Do (1972).
Symbolic artificial intelligence influenced Neuro-symbolic AI in Knowledge Representation Reasoning
Neuro-symbolic AI takes the symbolic reasoning machinery of classical symbolic AI (logic-based representation, rules, search) and couples it with neural components; the symbolic half of the hybrid is inherited directly from this tradition.
Symbolic artificial intelligence led to Computational Theory of Mind in Philosophy Of Artificial Intelligence
The computational theory of mind generalised the symbolic AI programme's claim that thinking is symbol manipulation into a philosophical thesis about mental states. It was articulated by philosophers drawing directly on AI work such as Newell and Simon's.
Carried by Hilary Putnam; Allen Newell; Herbert A. Simon.
Symbolic artificial intelligence led to Expert Systems in Philosophy Of Artificial Intelligence
Expert systems are a direct branch of symbolic AI, applying its rule-and-symbol manipulation to narrow domains of specialist knowledge. DENDRAL and MYCIN were built within the symbolic AI programme.
Carried by Edward Feigenbaum; DENDRAL.
Symbolic artificial intelligence led to Distributed Artificial Intelligence in Multiagent Systems
Distributed artificial intelligence grew directly out of symbolic AI: early DAI work took the symbolic problem-solving agents of classical AI and distributed them across multiple communicating problem solvers.
Symbolic artificial intelligence led to Sense–plan–act architecture in Robotics
Sense-plan-act robotics applied symbolic AI's representation-and-search methods to mobile robots, treating perception as building a symbolic world model for a planner.
Expert system grew out of Symbolic artificial intelligence in Philosophy Of Artificial Intelligence
Expert systems grew directly out of the symbolic AI programme as its applied branch, encoding specialist knowledge as symbol structures and rules. DENDRAL and MYCIN were built within the symbolic tradition.
Carried by Edward Feigenbaum.
Expert system led to Medical Expert Systems in Clinical Informatics
Expert system methods from artificial intelligence, notably production rules and certainty factors, were adopted in medical consultation programs such as MYCIN.
Carried by Edward H. Shortliffe; MYCIN.
Evolutionary Computation influenced Swarm Intelligence and Agent-Based Modeling in Multiagent Systems
Evolutionary computation supplied the population-based search and selection machinery that ant colony optimization and particle swarm optimization adapted into swarm algorithms.
Carried by Marco Dorigo; James Kennedy; Russell Eberhart.
Bayesian network influenced Graphical model in Probabilistic Ai
Bayesian networks are the central directed member of the graphical-model framework, and the later unified treatment generalised Pearl's belief networks alongside Markov fields and factor graphs. The graphical-model framework grew out of and absorbed the Bayesian-network formalism.
Carried by Judea Pearl; Michael I. Jordan.
Bayesian network influenced by Bayesian probability in Probability Theory
Bayes's theorem and the Bayesian probability calculus are the mathematical foundation on which Bayesian networks are built. Pearl's formalism applies Bayes's rule over graphical structures.
Carried by Thomas Bayes; Judea Pearl.

Artificial Intelligence is a planet in Nousfarer
Its city has a tower for each of these 11 frameworks. Land, walk in, and climb one concept at a time.
Land on Artificial IntelligenceRelated fields
Fields its ideas are linked to
- Philosophy Of Artificial Intelligence 13 links
- Multiagent Systems 6 links
- Reinforcement Learning 6 links
- Deep Learning 5 links
- Natural Language Processing 5 links
- Robotics 5 links
- Ai Safety 3 links
- Knowledge Representation Reasoning 3 links
- Probabilistic Ai 3 links
- Cognitive Science 3 links
- Medical Image Analysis 3 links
- Robot Learning 3 links
More in Artificial Intelligence
- Ai Ethics And Fairness
- Ai Safety
- Computer Vision
- Deep Learning
- Evolutionary Computation
- Knowledge Representation Reasoning
- Machine Learning
- Multiagent Systems
- Natural Language Processing
- Planning And Search
- Probabilistic Ai
- Reinforcement Learning
- Speech Recognition And Synthesis
See where Artificial Intelligence sits on the Map of Human Knowledge