A field guide to AI positions

Symbolic AI & expert systems

AI basics.

Publication dates and source age

Sources counted: 3

Publication dates are unavailable.

Assessed at this edition's evidence cutoff: 2026-09-15. 18-month boundary: 2025-03-15.

Some publication dates are unknown; the newest dated source may not be the newest source overall.

Publication age does not tell us whether a claim is still valid. Reading an old source again does not make its publication date newer. An update date does not establish that the passage we used was updated.

Open in the glossary Reading notes · Structured record

Prepared with AI assistance. Not independently fact-checked. Original sources and qualifications are below.

In plain language

Programs that work with explicitly represented facts and rules. An expert system applies such rules within a particular subject. [1] [2]

Reference this explanation or suggest a correction

Explanation based on the linked sources. Claim ID: claim-term-symbolic-ai-1a5192ba3d7825ca26b24a72. Edition 0.20.0.

Link to this explanation · Suggest a correction · How corrections work

Limits & distinctions

An expert system is one application of symbolic methods. Its encoded knowledge covers a limited domain. This differs from fitting a model's parameters to examples through machine learning. [2] [3]

Reference this explanation or suggest a correction

Explanation based on the linked sources. Claim ID: claim-term-symbolic-ai-09422ce4d5c74cb753a9bb98. Edition 0.20.0.

Link to this explanation · Suggest a correction · How corrections work

A fuller explanation

Developers encode facts and logical rules that software applies to a problem. An expert system combines a knowledge base with rules, often written as if-then conditions, drawn from a specific field. [1] [2]

Reference this explanation or suggest a correction

Explanation based on the linked sources. Claim ID: claim-term-symbolic-ai-1e4c26398ee834b2e16dc7b8. Edition 0.20.0.

Link to this explanation · Suggest a correction · How corrections work

How it relates to the map

Map context: this explains an AI approach based on explicitly programmed knowledge. [1]

Reference this explanation or suggest a correction

Editorial interpretation or qualification. Claim ID: claim-term-symbolic-ai-25f52a21ad9f2e54a62ed1b2. Edition 0.20.0.

Link to this explanation · Suggest a correction · How corrections work

Share this page

https://theaiatlas.org/ideas/symbolic-ai/

Download a share image · Vector image

Image previews are summaries. Keep the page link so readers can check the evidence.

Sources and what we read

  1. 1. What is Traditional AI?

    Stanford HAI · First-hand source · Published date unavailable · Material last read 2026-09-15

    Publication dates and source age

    Sources counted: 1

    Publication dates are unavailable.

    Assessed at this edition's evidence cutoff: 2026-09-15. 18-month boundary: 2025-03-15.

    Some publication dates are unknown; the newest dated source may not be the newest source overall.

    Publication age does not tell us whether a claim is still valid. Reading an old source again does not make its publication date newer. An update date does not establish that the passage we used was updated.

    Read scope is described in the source note.

    No archive check recorded.

    Read Stanford's institutional definition of explicitly programmed rules and symbolic reasoning. No publication date shown; mental-state wording is not adopted.

    Source ID: glossary-symbolic-stanford

  2. 2. What is an Expert System?

    Stanford HAI · First-hand source · Published date unavailable · Material last read 2026-09-15

    Publication dates and source age

    Sources counted: 1

    Publication dates are unavailable.

    Assessed at this edition's evidence cutoff: 2026-09-15. 18-month boundary: 2025-03-15.

    Some publication dates are unknown; the newest dated source may not be the newest source overall.

    Publication age does not tell us whether a claim is still valid. Reading an old source again does not make its publication date newer. An update date does not establish that the passage we used was updated.

    Read scope is described in the source note.

    No archive check recorded.

    Read knowledge-base, if-then-rule and limited-domain definitions. No publication date shown. Historical priority and broad interpretability claims are not adopted.

    Source ID: glossary-expert-stanford

  3. 3. What is Machine Learning?

    Google for Developers · First-hand source · Published date unavailable · Updated 2026-01-27 · Material last read 2026-09-15

    Publication dates and source age

    Sources counted: 1

    Publication dates are unavailable.

    Assessed at this edition's evidence cutoff: 2026-09-15. 18-month boundary: 2025-03-15.

    Some publication dates are unknown; the newest dated source may not be the newest source overall.

    Publication age does not tell us whether a claim is still valid. Reading an old source again does not make its publication date newer. An update date does not establish that the passage we used was updated.

    Read scope is described in the source note.

    No archive check recorded.

    Read the introduction, model definition, supervised and unsupervised learning, and generative AI sections. Examples illustrate categories rather than measured accuracy. Updated date follows the page; initial publication is unspecified.

    Source ID: google-ml-intro

Edition and machine-readable evidence

Content version 0.20.0. Evidence cutoff 2026-09-15; this does not mean every source was read on that day.

Pinned complete dataset · Complete evidence page · Agent consumption guide