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

Discourse Representation Theory

Research Depth 79 in the knowledge graph ☐ I know this ☆ Set as goal
489topics build on this
502prerequisites beneath it
See this on the map →
Discourse AnalysisFormal Pragmatics and Context+1 more→→Context-Update SemanticsDiscourse Coherence and Rhetorical Relations+2 more
pragmatics discourse formal

Core Idea

Discourse Representation Theory models discourse by building structured Discourse Representation Structures. Each sentence adds referents and conditions; pronouns resolve to established referents. This handles anaphora and presupposition accommodation in extended discourse: 'A woman entered. She was happy' succeeds, but 'A woman entered. She had three children' accommodates missing information.

Explainer

Your study of discourse analysis and formal pragmatics gave you two things: an understanding that meaning extends beyond the sentence, and some tools for thinking about how context shapes interpretation. Discourse Representation Theory (DRT), developed by Hans Kamp in the 1980s, provides the formal architecture that makes those intuitions precise. Its central insight is deceptively simple: to understand a discourse, you don't just interpret each sentence in isolation — you build a running mental model, and each new sentence updates that model.

The formal object DRT introduces is the Discourse Representation Structure (DRS), which you can think of as a box containing two things: a list of discourse referents (roughly, the individuals the discourse has introduced) and a list of conditions (propositions that are true of those referents in the model). When you hear "A farmer owns a donkey," the DRS box gets two new referents — call them *x* (the farmer) and *y* (the donkey) — plus the conditions *farmer(x)*, *donkey(y)*, and *owns(x,y)*. Nothing about this is exotic yet. The payoff comes with anaphora. When the next sentence is "He beats it," the pronouns *he* and *it* need to find antecedents. DRT says they can access the discourse referents already in scope: *he* can pick up *x* (the farmer), *it* can pick up *y* (the donkey). The conditions *beats(x,y)* get added to the same box. The discourse is now a single structured representation rather than two independent sentences.

This matters because it solves the donkey anaphora problem — a famous puzzle in formal semantics. "Every farmer who owns a donkey beats it" seems simple, but the pronoun *it* cannot be a simple variable bound by "a donkey" in the scope of "every farmer," because the scoping doesn't work out. DRT handles it elegantly: the indefinite "a donkey" inside the restrictor of "every farmer" introduces a referent that is accessible to the pronoun in the matrix clause, because both are inside the same conditional DRS structure. The box architecture tracks accessibility in a way that standard predicate logic does not.

Presupposition accommodation is the other major application. When someone says "A woman entered. She had three children," the second sentence presupposes the existence of three children — information not previously established. Rather than crashing, the discourse interpreter accommodates the presupposition by adding the three children as new referents to the DRS, inferring that they must exist because the sentence requires them to. DRT provides a principled account of when accommodation is possible (the presupposition is plausible and consistent with the model) and when it fails. This connects directly to the formal pragmatics you studied: accommodation is the mechanism by which context is dynamically enriched as discourse unfolds. The DRS is not a static representation of a situation; it is the record of an ongoing interpretive process in which each sentence both draws on and updates the shared context that speaker and hearer are building together.

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 → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Lambda Calculus → Lambda Calculus for Linguistic Semantics → Montague Semantics → Formal Pragmatics and Context → Relevance Theory and Pragmatic Inference → Discourse Representation Theory

Longest path: 80 steps · 502 total prerequisite topics

Prerequisites (3)

Leads To (4)