A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Semantic Networks

Graduate Depth 83 in the knowledge graph ☐ I know this ☆ Set as goal
10topics build on this
403prerequisites beneath it
See this on the map →
First-Order Logic for AIGraph Representations: Adjacency List vs. Adjacency Matrix→→Bayesian Networks and Inference
knowledge-representation conceptual-networks inference

Core Idea

Semantic networks represent knowledge as labeled directed graphs where nodes are concepts and edges represent relationships such as "is-a", "part-of", or "has-property". They enable inheritance (properties of a parent class apply to children) and path-based reasoning, though they are less expressive than first-order logic and can lead to ambiguity in reasoning.

Explainer

From your study of first-order logic, you know how to represent knowledge using predicates, quantifiers, and logical connectives — statements like ∀x(Bird(x) → CanFly(x)). This is precise and powerful, but it can be unwieldy for representing the kind of everyday knowledge that humans navigate effortlessly: "a robin is a bird," "birds have wings," "wings enable flight." Semantic networks represent this same knowledge as a labeled directed graph, where each concept is a node and each relationship is a labeled edge. The statement "a robin is a bird" becomes a node for Robin, a node for Bird, and a directed edge labeled "is-a" connecting them.

The most important feature of semantic networks is inheritance through the is-a hierarchy. If Bird has a "has-property" edge to Wings, and Robin has an "is-a" edge to Bird, then Robin automatically inherits the property Wings without needing to state it explicitly. This mirrors how humans organize knowledge taxonomically — you do not need to separately learn that every individual robin has wings, a beak, and feathers. You learn these facts about birds once, and every subclass inherits them. The graph structure from graph theory that you already understand makes this traversal natural: to find what properties a robin has, simply follow "is-a" edges upward and collect "has-property" edges along the way.

Semantic networks excel at representing default reasoning with exceptions. The general network might encode that birds can fly, but a specific "is-a" link from Penguin to Bird can override this with an explicit "cannot-fly" property. The convention is that more specific (closer) properties take precedence over inherited ones. This works intuitively for simple hierarchies but becomes problematic with multiple inheritance — if an object inherits from two parent classes that assign conflicting values to the same property, the network provides no principled way to resolve the conflict. This ambiguity is one reason semantic networks are considered less expressive than first-order logic, which can represent the same knowledge with explicit quantifiers and exception clauses.

Despite these limitations, semantic networks were foundational to AI knowledge representation and remain influential today. Their direct descendants include modern knowledge graphs like those powering search engines and recommendation systems, where billions of entity-relationship-entity triples (essentially semantic network edges) encode facts about the world. The intuitive visual structure makes semantic networks an excellent tool for organizing domain knowledge, even when the formal reasoning tasks require translation into a more rigorous representation.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Conditional Statements → Defining and Calling Functions → Functions: Decomposing Problems → Function Parameters and Argument Passing → Return Values → Variable Scope → Introduction to Classes → Objects and Instances → Methods and Attributes → Algorithm Design Basics → First-Order Logic for AI → Semantic Networks

Longest path: 84 steps · 403 total prerequisite topics

Prerequisites (2)

Leads To (1)