Skip to content

Discourse representation theory

A dynamic formal-semantics framework that builds discourse representation structures to track referents, conditions and anaphoric accessibility across sentences.

Version
v2 · 2026-09-19 · History
Domain-specific #
4202
Domain group
Humanities
Origin domain
Linguistics & Semiotics
Subdomain
Formal Semantics → Linguistics & Semiotics

Core Idea

DRT represents meaning as an incrementally updated structured context rather than isolated sentence denotations. Each clause introduces referents and constraints, and embedding determines which referents remain accessible for pronouns, tense and quantificational dependencies. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of formal semantics. It is A dynamic formal-semantics framework that builds discourse representation structures to track referents, conditions and anaphoric accessibility across sentences.

How would you explain it like I'm…

The Story Notebook

When someone tells you a story, you keep a little notebook in your head: 'there's a farmer, there's a donkey.' Each new sentence adds people and facts to the notebook, and when you hear 'he' or 'it,' you look in the notebook to see who it means. Discourse representation theory is a careful way of writing that notebook. If someone says 'Sam doesn't have a dog,' then 'It is brown' sounds strange, because there's no dog in the notebook to point at.

Boxes That Track Who's Who

Discourse representation theory is a way of explaining how we understand a whole conversation, not just one sentence at a time. As each sentence comes in, you add to a growing picture: new people or things (called referents) and facts about them. Words like 'he' or 'it' get matched to things already in the picture. The picture has boxes inside boxes, and something mentioned inside a box, like inside 'every' or 'if', can't always be pointed back to from outside it. That is why 'A farmer owns a donkey. He feeds it.' works, but 'Every farmer owns a donkey. He feeds it.' sounds odd.

Discourse Referents and Accessibility

Discourse representation theory (DRT) treats meaning as a structured context that is updated sentence by sentence, rather than giving each sentence a meaning on its own. Each clause adds discourse referents, the entities being talked about, along with conditions describing them. These are collected into a discourse representation structure, a box-like diagram that can contain smaller boxes for things like negation, conditionals, and quantifiers. Which box a referent sits in determines whether a later pronoun can refer to it. For example, after 'Every farmer who owns a donkey feeds it,' the 'it' can reach the donkey inside the same conditional structure, but a following sentence 'It is hungry' cannot. The same bookkeeping helps handle tense and dependencies created by quantifiers.

 

Discourse representation theory (DRT) is a dynamic framework in formal semantics that models meaning as an incrementally updated structured context rather than as isolated sentence denotations. Interpreting each clause adds discourse referents and conditions on them to a discourse representation structure (DRS). DRSs can be embedded inside one another, for instance under negation, in the antecedent and consequent of conditionals, or in the restrictor and scope of quantifiers, and the embedding defines an accessibility relation. A pronoun can be resolved only to a referent accessible from its position, which explains both successful cross-sentential anaphora and failures such as reference into a negated context. The same machinery tracks temporal reference and quantificational dependencies. An analysis counts as DRT when the constructed DRS and its accessibility relation license exactly the anaphoric and truth-conditional dependencies claimed.

Scope of Application

Discourse representation theory belongs to formal semantics and is useful where the analyst can specify a discourse, referent variables, conditions, discourse representation structures, update operation, accessibility relation and truth conditions, then evaluate the constructed DRS and accessibility relation license exactly the anaphoric and truth-conditional dependencies claimed. The scope is broad within that domain but bounded by the need for the constructed DRS and accessibility relation license exactly the anaphoric and truth-conditional dependencies claimed. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making the constructed DRS and accessibility relation license exactly the anaphoric and truth-conditional dependencies claimed the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Discourse representation theory can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Discourse representation theory. Discourse representation theory compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

  1. Identify the carrier. State what the elements, states, objects, or observations are: a discourse, referent variables, conditions, discourse representation structures, update operation, accessibility relation and truth conditions. Reject examples whose alleged carrier belongs to a different problem.
  2. Lock the constitutive rule. Express the constructed DRS and accessibility relation license exactly the anaphoric and truth-conditional dependencies claimed independently of one notation or implementation. This step prevents the canonical example from becoming the definition.

Knowledge Transfer

Knowledge transfers strongly among subfields of formal semantics because they reuse a discourse, referent variables, conditions, discourse representation structures, update operation, accessibility relation and truth conditions, Each clause introduces referents and constraints, and embedding determines which referents remain accessible for pronouns, tense and quantificational dependencies., and type the carrier, state every parameter and convention in the definition, test that the constructed DRS and accessibility relation license exactly the anaphoric and truth-conditional dependencies claimed, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Local relationship map for Discourse representation theoryParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Discourserepresentation theoryDOMAINPrime abstraction: Representation — is a kind ofRepresentationPRIME

Current abstraction Discourse representation theory Domain-specific

Parents (1) — outgoing typed relations

  • Discourse representation theory is a kind of Representation Prime

    What makes it its own entry: A dynamic formal-semantics framework that builds discourse representation structures to track referents, conditions and anaphoric accessibility across sentences.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Discourse representation theory sits in a crowded region of the domain-specific corpus (14th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Syntax, Semantics & Grammar Theory (24 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25