Skip to content

Default logic

A nonmonotonic formal logic that licenses defeasible conclusions when prerequisites hold and their justifications remain consistent with the evolving belief set.

Core Idea

Reiter default logic represents a theory as hard facts plus defaults of the form prerequisite:justifications/conclusion and defines extensions as self-supporting fixed points of applicable defaults. A candidate belief set begins with deductive closure of facts, applies defaults whose prerequisites are derivable and justifications are not contradicted, and iterates to a stable extension; multiple or absent extensions expose conflict. 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.

How would you explain it like I'm…

Usually-True Guessing Rules

Birds usually fly. So if someone tells you about a bird and nothing says it cannot fly, you guess it flies. But if you then find out it is a penguin, you take that guess back. Default logic is a way for computers to make careful guesses like that, using rules that say usually, unless you know otherwise.

Reasoning with 'Usually' Rules

Default logic is a way for computers to reason with rules that are usually true, not always true. It has hard facts, which are always believed, and default rules like: if something is a bird, and it is okay to assume it can fly, then conclude it can fly. A default rule is used only when its starting condition is known and nothing known contradicts its assumption. The computer keeps applying rules until it reaches a stable set of beliefs, called an extension. Sometimes rules conflict and there is more than one stable set, or none, which shows there is a clash in the rules.

Nonmonotonic Default Reasoning

Default logic, developed by Reiter, represents knowledge as hard facts plus default rules written as prerequisite : justifications / conclusion. A default says: if the prerequisite can be derived, and the justifications are consistent with what you believe, then you may conclude the conclusion. A set of beliefs built this way is called an extension: start with everything that logically follows from the facts, apply defaults whose conditions hold and whose justifications aren't contradicted, and repeat until it stabilizes. An extension has to support itself, meaning the defaults used must still be justified by the final result. Some theories have several extensions and some have none, which reveals conflicts; you can then accept only what's in every extension (skeptical) or in at least one (credulous).

 

Reiter's default logic represents a theory as a pair of hard facts and defaults of the form prerequisite : justifications / conclusion. Its semantics is given by extensions, defined as self-supporting fixed points of the applicable defaults. A candidate belief set starts from the deductive closure of the facts; a default is applied when its prerequisite is derivable and none of its justifications is contradicted by the belief set, and the process is iterated until the set is stable. Crucially, the consistency check is made against the final extension itself, which is why extensions are fixed points rather than simple forward closures. A theory can have multiple extensions, reflecting conflicting defaults, or none, exposing incoherence. Consequence must then be defined by convention: skeptical consequence takes what holds in all extensions, credulous consequence what holds in some. A complete specification makes the background theory, default rules, consistency test, extension semantics, and consequence convention explicit.

Scope of Application

Default logic belongs to knowledge representation and logic and is useful where the analyst can specify the typed knowledge representation and logic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the background theory, default rules, consistency test, extension semantics, and skeptical or credulous consequence convention are explicit. The scope is broad within that domain but bounded by the need for the background theory, default rules, consistency test, extension semantics, and skeptical or credulous consequence convention are explicit. 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 background theory, default rules, consistency test, extension semantics, and skeptical or credulous consequence convention are explicit 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 Default logic 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 Default logic. Default logic 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: the typed knowledge representation and logic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
  2. Lock the constitutive rule. Express the background theory, default rules, consistency test, extension semantics, and skeptical or credulous consequence convention are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of knowledge representation and logic because they reuse the typed knowledge representation and logic carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, A candidate belief set begins with deductive closure of facts, applies defaults whose prerequisites are derivable and justifications are not contradicted, and iterates to a stable extension; multiple or absent extensions expose conflict., and type the carrier, state every parameter and convention in the definition, test that the background theory, default rules, consistency test, extension semantics, and skeptical or credulous consequence convention are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Local relationship map for Default logicParents 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.Default logicDOMAINPrime abstraction: Formal System — is a kind ofFormal SystemPRIME

Current abstraction Default logic Domain-specific

Parents (1) — outgoing typed relations

  • Default logic is a kind of Formal System Prime

    It remains its own entry because its identity is fixed by the background theory, default rules, consistency test, extension semantics, and skeptical or credulous consequence convention.

Hierarchy paths (2) — routes to 2 parentless roots

Neighborhood in Abstraction Space

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

Family — Formal Logic & Computation Systems (24 abstractions)

Nearest neighbors

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