Well-founded semantics¶
A unique three-valued semantics for general logic programs that assigns each ground atom true, false or undefined.
Core Idea¶
Undefined represents unresolved recursion through negation rather than probability, the semantics is skeptical and unique unlike multiple stable models, and operational tabling implementations must correspond to the declarative fixed point. Alternating consequence and unfounded-set operators iteratively derive supported truths and identify atoms that cannot be supported; the least fixed point leaves negative cycles undefined. 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¶
Well-founded semantics belongs to logic programming and is useful where the analyst can specify the typed logic programming carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the normal logic program and grounding convention, atoms and rules with default negation, partial three-valued interpretation, immediate consequence and unfounded sets, alternating fixed-point construction, true false and undefined partitions, uniqueness and skeptical character, stratified-program special case and relation to stable-model semantics are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the normal logic program and grounding convention, atoms and rules with default negation, partial three-valued interpretation, immediate consequence and unfounded sets, alternating fixed-point construction, true false and undefined partitions, uniqueness and skeptical character, stratified-program special case and relation to stable-model semantics 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.
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 Well-founded semantics. Well-founded semantics 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 logic programming carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the normal logic program and grounding convention, atoms and rules with default negation, partial three-valued interpretation, immediate consequence and unfounded sets, alternating fixed-point construction, true false and undefined partitions, uniqueness and skeptical character, stratified-program special case and relation to stable-model semantics are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of logic programming because they reuse the typed logic programming carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Alternating consequence and unfounded-set operators iteratively derive supported truths and identify atoms that cannot be supported; the least fixed point leaves negative cycles undefined., and type the carrier, state every parameter and convention in the definition, test that the normal logic program and grounding convention, atoms and rules with default negation, partial three-valued interpretation, immediate consequence and unfounded sets, alternating fixed-point construction, true false and undefined partitions, uniqueness and skeptical character, stratified-program special case and relation to stable-model semantics are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Well-founded semantics Domain-specific
Parents (1) — more general patterns this builds on
-
Well-founded semantics is a kind of Fixed Point Prime
The proposed strict upward parent is
prime:fixed_point.
Hierarchy path (1) — routes to 1 parentless root
- Well-founded semantics → Fixed Point
Neighborhood in Abstraction Space¶
Well-founded semantics sits in a crowded region of the domain-specific corpus (11th 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
- Paraconsistent logic — 0.92
- Logical equality — 0.92
- Logical form — 0.92
- Proof-theoretic semantics — 0.92
- Type theory — 0.92
Computed from structural-signature embeddings · 2026-09-08