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.
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¶
- 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¶
Current abstraction Default logic Domain-specific
Parents (1) — more general patterns this builds on
-
Default logic is a kind of Formal System Prime
The proposed strict upward parent is
prime:formal_system.
Hierarchy paths (2) — routes to 2 parentless roots
- Default logic → Formal System → Formalization → Representation → Abstraction
- Default logic → Formal System → Formalization → Transformation → Function (Mapping)
Neighborhood in Abstraction Space¶
Default logic sits in a crowded region of the domain-specific corpus (17th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Formal Logic & Type Theory (34 abstractions)
Nearest neighbors
- Doxastic logic — 0.92
- Paraconsistent logic — 0.92
- Constructive dilemma — 0.92
- Type theory — 0.91
- Well-founded semantics — 0.91
Computed from structural-signature embeddings · 2026-09-08