Argumentation framework¶
A formal model representing arguments and attack relations so admissible, preferred, stable or grounded sets of jointly defensible arguments can be computed.
Core Idea¶
Dung’s abstract framework omits internal argument structure, while structured, bipolar, weighted and value-based extensions add different semantics; extension choice changes conclusions. Arguments become nodes in a directed attack graph, a semantics tests conflict-freeness and defense and fixed-point or maximality rules select extensions whose accepted claims determine conclusions. 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 artificial intelligence. It is the domain-specific identity fixed by the argument set, directed attack relation, conflict-free and defense definitions, characteristic operator, chosen grounded complete preferred stable or other semantics, resulting extensions and skeptical or credulous acceptance and any structured support value or weight extension are explicit.
Scope of Application¶
Argumentation framework belongs to artificial intelligence and is useful where the analyst can specify the typed artificial intelligence carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the argument set, directed attack relation, conflict-free and defense definitions, characteristic operator, chosen grounded complete preferred stable or other semantics, resulting extensions and skeptical or credulous acceptance and any structured support value or weight extension are explicit. The scope is broad within that domain but bounded by the need for the argument set, directed attack relation, conflict-free and defense definitions, characteristic operator, chosen grounded complete preferred stable or other semantics, resulting extensions and skeptical or credulous acceptance and any structured support value or weight extension are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the argument set, directed attack relation, conflict-free and defense definitions, characteristic operator, chosen grounded complete preferred stable or other semantics, resulting extensions and skeptical or credulous acceptance and any structured support value or weight extension 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 Argumentation framework. Argumentation framework 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 artificial intelligence 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 argument set, directed attack relation, conflict-free and defense definitions, characteristic operator, chosen grounded complete preferred stable or other semantics, resulting extensions and skeptical or credulous acceptance and any structured support value or weight extension are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of artificial intelligence because they reuse the typed artificial intelligence carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Arguments become nodes in a directed attack graph, a semantics tests conflict-freeness and defense and fixed-point or maximality rules select extensions whose accepted claims determine conclusions., and type the carrier, state every parameter and convention in the definition, test that the argument set, directed attack relation, conflict-free and defense definitions, characteristic operator, chosen grounded complete preferred stable or other semantics, resulting extensions and skeptical or credulous acceptance and any structured support value or weight extension are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Argumentation framework Domain-specific
Parents (1) — more general patterns this builds on
-
Argumentation framework is a kind of Formalization Prime
The proposed strict upward parent is
prime:formalization.
Hierarchy paths (2) — routes to 2 parentless roots
- Argumentation framework → Formalization → Representation → Abstraction
- Argumentation framework → Formalization → Transformation → Function (Mapping)
Neighborhood in Abstraction Space¶
Argumentation framework sits in a crowded region of the domain-specific corpus (25th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Algorithms, Proofs & Computational Decisions (25 abstractions)
Nearest neighbors
- Knowledge representation and reasoning — 0.92
- Appeal to consequences — 0.92
- Model-based reasoning — 0.91
- Type theory — 0.90
- Distributed artificial intelligence — 0.90
Computed from structural-signature embeddings · 2026-09-08