Argumentation framework

Updated on Dec 21, 2024

Edit

Comment

An argumentation framework, or argumentation system, is a way to deal with contentious information and draw conclusions from it.

In an abstract argumentation framework, entry-level information is a set of abstract arguments that, for instance, represent data or a proposition. Conflicts between arguments are represented by a binary relation on the set of arguments. In concrete terms, you represent an argumentation framework with a directed graph such that the nodes are the arguments, and the arrows represent the attack relation. There exist some extensions of the Dung's framework, like the logic-based argumentation frameworks or the value-based argumentation frameworks.

Formal framework

Abstract argumentation frameworks, also called argumentation frameworks à la Dung, are defined formally as a pair:

A set of abstract elements called arguments, denoted A

A binary relation on A , called attack relation, denoted R

For instance, the argumentation system S = ⟨ A , R ⟩ with A = { a , b , c , d } and R = { ( a , b ) , ( b , c ) , ( d , c ) } contains four arguments ( a , b , c and d ) and three attacks ( a attacks b , b attacks c and d attacks c ).

Dung defines some notions :

an argument a ∈ A is acceptable with respect to E ⊆ A if and only if E defends a , that is ∀ b ∈ A such that ( b , a ) ∈ R , ∃ c ∈ E such that ( c , b ) ∈ R ,

a set of arguments E is conflict-free if there is no attack between its arguments, formally : ∀ a , b ∈ E , ( a , b ) ∉ R ,

a set of arguments E is admissible if and only if it is conflict-free and all its arguments are acceptables with respect to E .

Extensions

To decide if an argument can be accepted or not, or if several arguments can be accepted together, Dung defines several semantics of acceptance that allow, given an argumentation system, to compute sets of arguments, called extensions. For instance, given S = ⟨ A , R ⟩ ,

E is a complete extension of S only if it is an admissible set and every acceptable argument with respect to E belongs to E ,

E is a preferred extension of S only if it is a maximal element (with respect to the set-theoretical inclusion) among the admissible sets with respect to S ,

E is a stable extension of S only if it is a conflict-free set that attacks every argument that does not belong in E (formally, ∀ a ∈ A ∖ E , ∃ b ∈ S such that ( b , a ) ∈ R ,

E is the (unique) grounded extension of S only if it is the smallest element (with respect to set inclusion) among the complete extensions of S .

There exists some inclusions between the sets of extensions built with these semantics :

Every stable extension is preferred,

Every preferred extension is complete,

The grounded extension is complete,

If the system is well-founded (there exists no infinite sequence a 0 , a 1 , … , a n , … such that ∀ i > 0 , ( a i + 1 , a i ) ∈ R ), all these semantics coincide—only one extension is grounded, stable, preferred, and complete.

Some other semantics have been defined.

One introduce the notation E x t σ ( S ) to note the set of σ -extensions of the system S .

In the case of the system S in the figure above, E x t σ ( S ) = { { a , d } } for every Dung's semantic—the system is well-founded. That explains why the semantics coincide, and the accepted arguments are: a and d .

Labellings

Labellings are a more expressive way than extensions to express the acceptance of the arguments. Concretely, a labelling is a mapping that associates every argument with a label in (the argument is accepted), out (the argument is rejected), or undec (the argument is undefined—not accepted or refused). One can also note a labelling as a set of pairs ( a r g u m e n t , l a b e l ) .

Such a mapping does not make sense without additional constraint. The notion of reinstatement labelling guarantees the sense of the mapping. L is a reinstatement labelling on the system S = ⟨ A , R ⟩ if and only if :

∀ a ∈ A , L ( a ) = i n if and only if ∀ b ∈ A such that ( b , a ) ∈ R , L ( b ) = o u t

∀ a ∈ A , L ( a ) = o u t if and only if ∃ b ∈ A such that ( b , a ) ∈ R and L ( b ) = i n

∀ a ∈ A , L ( a ) = u n d e c if and only if L ( a ) ≠ i n and L ( a ) ≠ o u t

One can convert every extension into a reinstatement labelling: the arguments of the extension are in, those attacked by an argument of the extension are out, and the others are undec. Conversely, one can build an extension from a reinstatement labelling just by keeping the arguments in. Indeed, Caminada proved that the reinstatement labellings and the complete extensions can be mapped in a bijective way. Moreover, the other Datung's semantics can be associated to some particular sets of reinstatement labellings.

Reinstatement labellings distinguish arguments not accepted because they are attacked by accepted arguments from undefined arguments—that is, those that are not defended cannot defend themselves. An argument is undec if it is attacked by at least another undec. If it is attacked only by arguments out, it must be in, and if it is attacked only by arguments in, then it is out.

The unique reinstatement labelling that corresponds to the system S above is L = { ( a , i n ) , ( b , o u t ) , ( c , o u t ) , ( d , i n ) } .

Inference from an argumentation system

In the general case when several extensions are computed for a given semantic σ , the agent that reasons from the system can use several mechanisms to infer information:

Credulous inference: the agent accepts an argument if it belongs to at least one of the σ -extensions—in which case, the agent risks accepting some arguments that are not acceptable together ( a attacks b , and a and b each belongs to an extension)

Skeptical inference: the agent accepts an argument only if it belongs to every σ -extension. In this case, the agent risks deducing too little information (if the intersection of the extensions is empty or has a very small cardinal).

For these two methods to infer information, one can identify the set of accepted arguments, respectively C r σ ( S ) the set of the arguments credulously accepted under the semantic σ , and S c σ ( S ) the set of arguments accepted skeptically under the semantic σ (the σ can be missed if there is no possible ambiguity about the semantic).

Of course, when there is only one extension (for instance, when the system is well-founded), this problem is very simple: the agent accepts arguments of the unique extension and rejects others.

The same reasoning can be done with labellings that correspond to the chosen semantic : an argument can be accepted if it is in for each labelling and refused if it is out for each labelling, the others being in an undecided state (the status of the arguments can remind the epistemic states of a belief in the AGM framework for dynamic of beliefs).

Equivalence between argumentation frameworks

There exists several criterions of equivalence between argumentation frameworks. Most of those criteria concern the sets of extensions or the set of accepted arguments. Formally, given a semantic σ :

E Q 1 : two argumentation frameworks are equivalent if they have the same set of σ -extensions, that is S 1 ≡ 1 S 2 ⇔ E x t σ ( S 1 ) = E x t σ ( S 2 ) ;

E Q 2 : two argumentation frameworks are equivalent if they accept skeptically the same arguments, that is S 1 ≡ 2 S 2 ⇔ S c σ ( S 1 ) = S c σ ( S 2 ) ;

E Q 2 : two argumentation frameworks are equivalent if they accept credulously the same arguments, that is S 1 ≡ 3 S 2 ⇔ C r σ ( S 1 ) = C r σ ( S 2 ) .

The strong equivalence says that two systems S 1 and S 2 are equivalent if and only if for all other system S 3 , the union of S 1 with S 3 is equivalent (for a given criterion) with the union of S 2 and S 3 .

Other kind of argumentation frameworks

The abstract framework of Dung has been instantiated to several particular cases.

Logic-based argumentation frameworks

In the case of logic-based argumentation frameworks, an argument is not an abstract entity, but a pair, where the first part is a minimal consistent set of formulae enough to prove the formula for the second part of the argument. Formally, an argument is a pair ( Φ , α ) such that

Φ ⊬ ⊥

Φ ⊢ α

Φ is a minimal set of Δ satisfying α where Δ is a set of formulae used by the agent to reason.

One calls α a consequence of Φ , and Φ a support of α .

In this case, the attack relation is not given in an explicit way, as a subset of the Cartesian product A × A , but as a property that indicates if an argument attacks another. For instance,

Relation defeater : ( Ψ , β ) attacks ( Φ , α ) if and only if β ⊢ ¬ ( ϕ 1 ∧ ⋯ ∧ ϕ n ) for { ϕ 1 , … , ϕ n } ⊆ Φ

Relation undercut : ( Ψ , β ) attacks ( Φ , α ) if and only if β = ¬ ( ϕ 1 ∧ ⋯ ∧ ϕ n ) for { ϕ 1 , … , ϕ n } ⊆ Φ

Relation rebuttal : ( Ψ , β ) attacks ( Φ , α ) if and only if β ⇔ ¬ α is a tautology

Given a particular attack relation, one can build a graph and reason in a similar way to the abstract argumentation frameworks (use of semantics to build extension, skeptical or credulous inference), the difference is that the information inferred from a logic based argumentation framework is a set of formulae (the consequences of the accepted arguments).

Value-based argumentation frameworks

The value-based argumentation frameworks come from the idea that during an exchange of arguments, some can be stronger than others with respect to a certain value they advance, and so the success of an attack between arguments depends of the difference of these values.

Formally, a value-based argumentation framework is a tuple V A F = ⟨ A , R , V , v a l , v a l p r e f s ⟩ with A and R similar to the standard framework (a set of arguments and a binary relation on this set), V is a non empty set of values, v a l is a mapping that associates each element from A to an element from V , and v a l p r e f s is a preference relation (transitive, irreflexive and asymmetric) on V × V .

In this framework, an argument a defeats another argument b if and only if

a attacks b in the "standard" meaning: ( a , b ) ∈ R ;

and ( v a l ( b ) , v a l ( a ) ) ∉ v a l p r e f s , that is the value advanced by b is not preferred to the one advanced by a .

One remarks that an attack succeeds if both arguments are associated to the same value, or if there is no preference between their respective values.

Assumption-based argumentation frameworks

In assumption-based argumentation frameworks, arguments are defined as a set of rules and attacks are defined in terms of assumptions and contraries.

Formally, an assumption-based argumentation framework is a tuple ⟨ L , R , A , ␣ ¯ ⟩ , where

⟨ L , R ⟩ is a deductive system, where L is the language and R is the set of inference rules in the form of s 0 ← s 1 , … , s m , for m > 0 and s 0 , s 1 , … , s m ∈ L ;

A , where A ⊆ L is a non-empty set, named the assumptions;

␣ ¯ is a total mapping from A to L , where a ¯ is defined as the contrary of a .

As a consequence of defining an ABA, an argument can be represented in a tree-form. Formally, given a deductive system ⟨ L , R ⟩ and set of assumptions A ⊆ L , an argument for claim c ∈ L supported by S ⊆ A , is a tree with nodes labelled by sentences in L or by symbol τ , such that:

The root is labelled by c

For each node N ,

If N is a leaf node, then N is labelled by either an assumption or by τ

If N is not a leaf node, then there is an inference rule l N ← s 1 , . . . , s m , ( m ≥ 0 ) , where l N is the label of N and

If m = 0 , then the rule shall be l N ← τ (i.e. child of N is τ )

Otherwise, N has m children, labelled by s 1 , . . . , s m

S is the set of all assumptions labeling the leave nodes

An argument with claim c supported by a set of assumption S can also be denoted as S ⊢ c

References

Argumentation framework Wikipedia

(Text) CC BY-SA

Contents