Leila Suffix

Philippe Suffix

Leila Amgoud
email: amgoud@irit.fr

Philippe Besnard
email: besnard@irit.fr

Besnard Particle Given Name

Keywords: separated by '-') Defeasible reasoning -Rule-based systems -Argumentation Defeasible reasoning, Rule-based systems, Argumentation 1 Introduction

Rule-based argumentation systems are developed for reasoning about defeasible information. As a major feature, their logical language distinguishes between strict rules (encoding strict information) and defeasible rules (describing general behavior with exceptional cases). They build arguments by chaining such rules, define attacks between them, use a semantics for evaluating the arguments and finally identify the plausible conclusions that follow from the rules. Focusing on the family of inconsistency-based attack relations, this paper presents the first study of the outcomes of such systems under various acceptability semantics, namely naive, stable, semi-stable, preferred, grounded and ideal. It starts by extending the existing list of rationality postulates that any rule-based system should satisfy. Then, it defines the key notion of option of a theory (a theory being a set of facts, a set of strict rules and a set of defeasible rules). For each of the cited semantics, it characterizes the extensions of a rule-based system that satisfies all the postulates in terms of options of the theory under which the system is built. It also fully characterizes the set of plausible conclusions of the system. The results show that designing a rule-based argumentation system requires great care.

the arguments using a given semantics and finally identifying the plausible claims on the basis of the strength of their arguments.

Dung proposed in [START_REF] Dung | On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games[END_REF] various semantics at an abstract level, i.e., without taking into account the structure of arguments or the nature of attacks. His abstract framework was instantiated by several scholars. The idea is as follows: Start with a knowledge base whose elements are encoded in a logical language, generate arguments using the consequence operator attached to the language, identify the attacks and apply Dung's semantics for the evaluation task. There were two major categories of instantiations for this abstract framework. The first category uses deductive logics (such as propositional logic [START_REF] Amgoud | Inferring from inconsistency in preference-based argumentation frameworks[END_REF][START_REF] Gorogiannis | Instantiating abstract argumentation with classical logic arguments: postulates and properties[END_REF] or any Tarskian logic [START_REF] Amgoud | Logical limits of abstract argumentation frameworks[END_REF]), whereas the second category uses rule-based languages. These languages distinguish between:

• facts which are information about particular instances like "My laptop is heavy."

• strict rules which encode general laws about classes of instances like "First generation laptops are heavy." Such rules do not have exceptions.

• defeasible rules which describe general behavior with exceptional cases. Defeasible rules correspond thus to what is called defaults in [START_REF] Reiter | A logic for default reasoning[END_REF]orconditional assertions in [START_REF] Benferhat | Contextual handling of conditional knowledge[END_REF][START_REF] Kraus | Nonmonotonic reasoning, preferential models and cumulative logics[END_REF].

Examples of rule-based argumentation systems are: aspic [START_REF] Amgoud | Towards a consensual formal model: inference part. Deliverable of ASPIC project 9. Prakken H[END_REF], its extended version aspic+

[9], DeLP [START_REF] García | Defeasible logic programming: an argumentative approach[END_REF] and the systems developed in [START_REF] Amgoud | An argumentation system for defeasible reasoning[END_REF][START_REF] Governatori | Argumentation semantics for defeasible logic[END_REF][START_REF] Lam | What are the necessity rules in defeasible reasoning?[END_REF][START_REF] Strass | Instantiating knowledge bases in abstract dialectical frameworks[END_REF][START_REF] Wyner | On the instantiation of knowledge bases in abstract argumentation frameworks[END_REF]. Despite the popularity of these systems, the results they return have not been characterized yet, except the system discussed in [START_REF] Amgoud | An argumentation system for defeasible reasoning[END_REF].

The following questions are thus still open:

• what are the underpinnings of the extensions under various semantics?

• do the semantics return different results as at the abstract level?

• what is the number of extensions a system may have?

• what are the plausible conclusions with such systems?

In this paper, we answer all the four questions in three steps: We start by defining a rule-based argumentation system over a knowledge base called theory (a set of facts, a set of strict rules and a set of defeasible rules). The system uses a notion of derivation schema for generating arguments from the theory. For the sake of generality, the attack relation is left unspecified.

However, it has the property of being conflict-dependent, that is, it captures the inconsistency that may be present in the theory. It is worth mentioning that all existing attack relations (like rebuttal and assumption attack) are conflict-dependent. A notable exception is undercutting which aims at blocking the application of defeasible rules [START_REF] Pollock | How to reason defeasibly[END_REF].

In a second step, we extend the list of postulates (consistency, closure under strict rules)

proposed in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF]. The aim of those postulates is to mathematically capture what humans perceive as rationale behavior from the semantics of defeasible theories. They are thus desirable properties that a system should satisfy. We introduce three new postulates. The first one, strict precedence, ensures that any claim that follows from the strict part of a theory is a plausible conclusion of the argumentation system. The second postulate, exhaustiveness, ensures a form of completeness of the extensions of an argumentation system. The third postulate, closure under sub-arguments, states that an argument cannot be accepted if one of its sub-parts is questionable.

Finally, we investigate the outputs of rule-based argumentation systems that satisfy all the postulates. We show that naive extensions return options of the theory (an option being a sub-theory that gathers a maximal-up to consistency-set of the facts, strict rules, and defeasible rules). Furthermore, the set of plausible conclusions under the naive semantics contains all the conclusions that are drawn from all the options. Stable extensions return preferred options but not necessarily all of them; it depends on the attack relation at work. Unlike An argumentation framework (A, R) is represented as a graph, argumentation graph, whose nodes are the arguments of A and its edges are the attacks in R. Arguments are evaluated using a semantics, i.e., a set of criteria that should be satisfied by an argument in order to be acceptable. Throughout this paper, we focus on extension-based semantics initially introduced by Dung [START_REF] Dung | On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games[END_REF]. Such semantics look for acceptable sets of arguments, called extensions. Each extension represents a coherent point of view and satisfies two basic properties: conflict-freeness and defense. Definition 2 (Conflict-freeness, defense, admissibility)LetH = (A, R) be an argumentation framework and E ⊆ A.

• E is conflict-free iff ∄a, b ∈ E such that (a, b) ∈ R.
• E defends an argument a iff ∀b ∈ A,if(b, a) ∈ R,thenE attacks b.

• E is an admissible set iff E is conflict-free and defends all its elements.

The following definition recalls the main semantics that were proposed in [START_REF] Dung | On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games[END_REF][START_REF] Caminada | Semi-stable semantics[END_REF][START_REF] Dung | Computing ideal skeptical argumentation[END_REF]. It is worth noticing that all those semantics are based on the notion of admissibility. Definition 3 (Semantics)LetH = (A, R) be an argumentation framework, and E ⊆ A be a conflict-free set.

• E is a preferred extension iff E is a maximal (w.r.t. ⊆) complete extension.

• E is a stable extension iff E attacks any argument in A\E.

• E is a semi-stable extension iff E is a complete extension and the union of the set E and the set of all arguments attacked by E is maximal (w.r.t. ⊆).

• E is a grounded extension iff E is a minimal (w.r.t. ⊆) complete extension.

• E is an ideal extension iff E is a maximal (w.r.t. ⊆) admissible set contained in every preferred extension.

An argumentation framework has a single grounded (respectively ideal) extension. However, it may have several naive, admissible, complete, preferred, stable and semi-stable extensions. It may also have zero stable extensions.

Notations Let H = (A, R) be an argumentation framework. We denote by Ext x (H) the set of all extensions of H under semantics x ∈{ n, p, s, ss},w h e r en (respectively p, s, ss) stands for naive (respectively preferred, stable and semi-stable). We denote by GE(H) (respectively IE(H)) the single grounded (respectively ideal) extension of H. When we do not need to refer to a particular semantics, we write Ext(H) for short.

The following result recalls some key properties of these semantics.

Property 1 [START_REF] Dung | On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games[END_REF][START_REF] Caminada | Semi-stable semantics[END_REF][START_REF] Dung | Computing ideal skeptical argumentation[END_REF]] Let H = (A, R) be an argumentation framework.

• Ext s (H) ⊆ Ext n (H) • Ext s (H) ⊆ Ext p (H) • If |Ext s (H)| > 0,thenExt s (H) = Ext ss (H)
• H has one grounded (respectively ideal) extension

• GE(H) ⊆ IE(H)

When Ext s (H) = Ext p (H), the framework H is said to be coherent. It is also worth recalling that an argumentation framework that has an infinite set of arguments may have an infinite number of extensions (under multiple-extensions semantics). This framework has eight naive extensions:

Let us now illustrate the different semantics on the argumentation framework

• E 1 ={a, c, g},
• E 2 ={d, e, f },

• E 3 ={b, d, f },
• E 4 ={a, e, g},

• E 5 ={a, b, g},

• E 6 ={b, e, g},

• E 7 ={b, d, g},and A formal characterization of the outcomes of rule-based… H 1 has one stable/semi-stable extension E 3 and two preferred extensions: E 3 and E 6 ={a, g}.

• E 8 ={c, f }.
Its grounded and ideal extensions are empty (GE(H 1 ) = IE(H 1 ) =∅).

Consider now the following argumentation framework H 2 borrowed from [START_REF] Dung | Computing ideal skeptical argumentation[END_REF]. It lays bare some differences between ideal and grounded semantics.

a b c d
It can be checked that:

• GE(H 2 ) =∅,

• Ext p (H 2 ) ={{b, c}, {b, d}},and

• IE(H 2 ) ={b}.
Throughout the paper, we will refer to the seven semantics of Definition 3 by the reviewed semantics, and by extension-based semantics to any semantics, which partitions the power set of the set of arguments into two parts: extensions and non-extensions. Note that there are other semantics in the literature like recursive [START_REF] Baroni | SCC-recursiveness: a general schema for argumentation semantics[END_REF]andstage [START_REF] Verheij | Two approaches to dialectical argumentation: Admissible sets and argumentation stages[END_REF] that follow this line of research. This distinction is important since some of the results in the next sections hold for any extension-based semantics, while others hold under the reviewed ones.

Rule-based logical language

In what follows, L is a set of literals, i.e., atoms or negation of atoms. The negation of an atom x from L is denoted ¬x. We consider two additional constants ⊤ and σ such that ⊤ / ∈ L and σ/ ∈ L. Three kinds of information are distinguished:

• Facts, which are elements of L ∪{⊤}

• Strict rules, which are of the form x 1 ,...,x n → x (x, x 1 ,...,x n denoting literals in L)

• Defeasible rules, which are of the form x 1 ,...,x n ⇒ x or of the form ⊤⇒x (x, x 1 ,...,x n denoting literals in L)

Facts are information about particular instances. A strict rule expresses general information that has no exception. It is read as follows: If x 1 ,...,x n hold, then x always holds. A defeasible rule of the form x 1 ,...,x n ⇒ x expresses general information that may have exceptions and is read as follows: If x 1 ,...,x n hold, then generally x holds as well. A defeasible rule of the form ⊤⇒x expresses that x is a defeasible fact and is read as follows:

generally x holds. Unlike existing systems like ASPIC [START_REF] Amgoud | Towards a consensual formal model: inference part. Deliverable of ASPIC project 9. Prakken H[END_REF] where a strict rule with an empty body represents a fact, in our formalism we keep general information and factual information separate.

Let L ′ beasetofatoms used for naming rules with the constraints L ∩ L ′ =∅, ⊤ / ∈ L ′ and σ/ ∈ L ′ . Every rule has a unique name and two rules cannot have the same name. Throughout the paper, rules are named r, r 1 , r 2 ,... Notations Let r ∈ L ′ , the function Rule(r ) returns the (strict or defeasible) rule whose name is r . For each rule x 1 ,...,x n → x (respectively x 1 ,...,x n ⇒ x or ⊤⇒x)

whose name is r ,t h ehead of the rule is Head(r ) = x and the body of the rule is Body(r ) ={ x 1 ,...,x n } or Body(r ) ={ ⊤ } .L e tT = (F, S, D) and

T ′ = (F ′ , S ′ , D ′
) be two theories. We say that T is a sub-theory of T ′ , written

T ⊑ T ′ ,iffF ⊆ F ′ and S ⊆ S ′ and D ⊆ D ′ . The relation ⊏ is the strict version of ⊑ (i.e.
, it is the case that at least one of the three inclusions is strict).

The notion of consistency is defined as follows:

Definition 5 (Consistency)AsetX ⊆ L is consistent iff ∄x, y ∈ X such that x =¬y.Itis inconsistent otherwise.
This simple definition of consistency is sufficient since the language L contains only literals. However, it is not suitable in case of richer languages. Assume that L is a propositional language. Thus, the set {x, y, ¬x ∨¬y} is consistent with respect to the above definition while it is clearly not the case. Thus, richer languages require a stronger definition of consistency like the one proposed in [START_REF] Tarski | Logic, semantics, metamathematics[END_REF].

Without loss of generality, throughout the paper we make the three following assumptions about rules.

Assumptions

The body of every (strict/defeasible) rule is finite and not empty. Moreover, for each rule r , Body(r )∪{Head(r )} is consistent. We say that r is consistent.

Note that the fact that rules are consistent does not ensure the consistency of a set of rules.

[23] discussed different forms of rule consistency. One of them is illustrated by the example {x ⇒ y, y ⇒¬ x} where both defeasible rules are consistent whereas together lead to an inconsistent rule x ⇒¬x.

Let us now show how new information (i.e., literal) is produced from a given theory. This is generally the case when (strict and/or defeasible) rules are fired in a derivation schema.

Below we provide a definition which generalizes derivations as defined by [START_REF] García | Defeasible logic programming: an argumentative approach[END_REF][START_REF] Marek | A theory of nonmonotonic rule systems I[END_REF] and others.

Definition 6 (Derivation schema)L e tT = (F, S, D) be a theory, x ∈ L.Aderivation schema for x from T is a finite sequence d = (x 1 , r 1 ),...,(x n , r n ) such that:

• x n = x
• for i ∈{1,...,n},

• x i ∈ F and r i = σ ,or

• x i = Head(r i ), with r i ∈ S ∪ D and Body(r i ) ⊆{x 1 , .., x i-1 } Seq(d) = {x 1 ,...,x n }. Facts(d) = {x i | i ∈{1,...,n}, r i = σ }. Strict(d) = {r i | i ∈{1,...,n}, r i ∈ S}. Def(d) = {r i | i ∈{1,...,n}, r i ∈ D}.
In order to improve readability, we somehow abuse the notation: we use the rules themselves instead of their names.

Example 1 Consider the theory T 1 such that F 1 , S 1 , D 1 are as follows.

F 1 p q S 1 ⎧ ⎨ ⎩ p → s (r 1 ) q →¬s (r 2 ) p, s → u (r 3 ) D 1 ⎧ ⎨ ⎩ ¬s ⇒ t (r 4 ) t, u ⇒ v( r 5 ) p ⇒ q (r 6 )

u n c o r r e c t e d p r o o f

A formal characterization of the outcomes of rule-based… Each of ( 1)-( 7) below is a derivation schema from theory T 1 ( p,σ)

(

(q,σ),(¬s, r 2 )

( p,σ),(s, r 1 ), (u, r 3 )

( p,σ),(s, r 1 ), ( p,σ),(u, r 3 )

( p,σ),(q,σ),(s, r 1 ), (u, r 3 )

( p,σ),(q, r 6 ), (¬s, r 2 )

( p,σ),(q,σ),(¬s, r 2 ), (s, r 1 ), (u, r 3 ), (t, r 4 ), (v, r 5 )

A derivation schema is not necessarily consistent (such as [START_REF] Kraus | Nonmonotonic reasoning, preferential models and cumulative logics[END_REF] above), as it may contain opposite literals in the form x i =¬ x j for some i and j. Interestingly enough, there are two ways for a derivation schema not to be minimal for set inclusion: (i) involving superfluous literals, i.e., literals that do not serve toward inferring the conclusion as is illustrated by ( 5)i nE x a m p l e1 (q is of no use there), (ii) involving redundancy (hence, repeated literals) as illustrated by ( 4)inExample1 ( p is repeated twice).

Definition 8 (Focused derivation schema)L e tT = (F, S, D) be a theory and x ∈ L.A derivation schema d = (x 1 , r 1 ),...,(x n , r n ) for x from T is focused iff it can be reduced to a minimal one by just deleting repeated pairs (x i , r i ).

Property 2 Let T = (F, S, D) be a theory and x ∈ L. A derivation schema d = (x 1 , r 1 ),...,(x n , r n ) for x from T is minimal iff d is focused and the literals x 1 ,...,x n are pairwise distinct.

Notations For a theory T , CN(T ) denotes the set of all literals that have a derivation schema from T . We call CN(T ) the potential consequences drawn from T (for short, consequences) but they need not be definitive as they may happen to be dismissed by opposite conclusions.

The following property applies to the consequences drawn from a given theory.

Property 3 Let T = (F, S, D) be a theory.

• CN(T ) ⊆ F ∪{Head(r ) | r ∈ S ∪ D}⊆L • If T is finite, then CN(T ) is finite • F ⊆ CN((F, S, ∅)) ⊆ CN(T )
•⊤∈CN(T )

• CN(T ) ={⊤}iff F ={⊤}and ∄r ∈ D such that Body(r ) ={⊤}.

• If d is a derivation schema from T , Seq(d) ⊆ CN(T ) Some rules may not be activated (i.e., the literals in their body have no derivation schema).

Let us consider the following example. Example 2 Let T 2 = (F 2 , S 2 , D 2 ) be a theory such that

F 2 p q S 2 p → t (r 1 ) s → u (r 2 ) D 2 p ⇒ q (r 3 ) u ⇒ v( r 4 )
There are rules here whose head is not a consequence of T 2 . In symbols, CN(T 2 ) ={p, q, t}⊂ { p, q, t, u,v}=F 2 ∪{Head(r

) | r ∈ S 2 ∪ D 2 }.
Namely, the two rules r 2 and r 4 are not activated.

It is also easy to show that CN is monotonic. Note that a similar result was shown in [START_REF] Hunter | Base logics in argumentation[END_REF] for the logic underlying the ASPIC system [START_REF] Amgoud | Towards a consensual formal model: inference part. Deliverable of ASPIC project 9. Prakken H[END_REF].

Property 4 Let T and T ′ be two theories.

If T ⊑ T ′ then CN(T ) ⊆ CN(T ′ ).
Let us now introduce the key notion of option which is useful for characterizing the extensions of argumentation systems under various semantics. An option is a maximal (for set inclusion) consistent sub-theory of a given theory.

Definition 9 (Option)L e tT = (F, S, D) be a theory. An option of T is a sub-theory

T ′ = (F ′ , S ′ , D ′ ) of T such that: • F ′ ⊆ F , S ′ ⊆ S and D ′ ⊆ D • CN(T ′ ) is consistent • ∄T ′′ ⊑ T such that T ′ ⊏ T ′′ and CN(T ′′ ) is consistent.
Opt(T ) denotes the set of all options of T .

Let us illustrate this new notion by the following example.

Example 3 Consider T 3 such that F 3 , S 3 , D 3 are as follows.

F 3 ⎧ ⎨ ⎩ p q ¬s S 3 t,v → s (r 1 ) D 3 ⎧ ⎨ ⎩ p ⇒ t (r 2 ) q ⇒ u (r 3 ) u ⇒ v( r 4 )
The theory T 3 has seven options:

• O 1 = (F 3 , S 3 , {r 2 , r 3 }) • O 2 = (F 3 , S 3 , {r 2 , r 4 }) • O 3 = (F 3 , S 3 , {r 3 , r 4 }) • O 4 = (F 3 , ∅, D 3 ) • O 5 = ({ p, q}, S 3 , D 3 ) • O 6 = ({ p, ¬s}, S 3 , D 3 ) • O 7 = ({q, ¬s}, S 3 , D 3 )
A theory has at least one option which is the theory itself in case it is consistent. This is the case in Example 2: Opt(T 2 ) ={T 2 }.

Property 5 Let T = (F, S, D) be a theory.

• Opt(T ) =∅.

• Opt(T ) ={T } iff CN(T ) is consistent.

We show next that options are all pairwise distinct. The definition of option does not make any difference between the strict part of a theory (i.e., its facts and strict rules) and its defeasible part. In rule systems [START_REF] Marek | A theory of nonmonotonic rule systems I[END_REF], the former takes precedence over the latter since it represents the "certain" information of a theory. For instance, in default logic the certain part belongs to every extension of a theory [START_REF] Reiter | A logic for default reasoning[END_REF]. This precedence is captured by the following notion of preferred option.

Definition 10 (Preferred option)LetT = (F, S, D) be a theory. A preferred option of T is a sub-theory T ′ = (F ′ , S ′ , D ′ ) of T such that:

• F ′ = F and S ′ = S, D ′ ⊆ D,
• CN(T ′ ) is consistent,

•∀ r ∈ D\D ′ , CN((F, S, D ′ ∪{r })) is inconsistent.
POpt(T ) denotes the set of all preferred options of T .

Let us illustrate this notion by an example.

Example 3 (Cont) The theory T 3 has three preferred options:

O 1 , O 2 and O 3 . ⊓ ⊔
Unlike options, the defeasible rules of a theory do not necessarily belong to at least one preferred option of the theory as shown by the following example.

Example 4

The theory T 4 such that

F 4 p q S 4 p → s (r 1 ) D 4 p ⇒¬s (r 2 )
has a single preferred option O = (F 4 , S 4 , ∅) which does not contain the unique defeasible rule r 2 .

Every preferred option is an option. The converse holds only when the theory is consistent in which case the latter is the only (preferred) option (cf. Property 5).

Property 6 Let T = (F, S, D) be a theory.

• POpt(T ) ⊆ Opt(T ).

• Opt(T ) ⊆ POpt(T ) iff CN(T ) is consistent.

A theory may not have preferred options. This is in particular the case when the strict part (the set of facts and strict rules) is inconsistent.

Property 7 Let T = (F, S, D) be a theory.

• POpt(T ) =∅iff CN((F, S, ∅)) is inconsistent.
• Fo r a l l r ∈ D,i fCN((F, S, {r })) is consistent, then there exists a preferred option O such that (F, S, {r }) ⊑ O.

Notice that the set of consequences of an (preferred) option is not necessarily maximal for set inclusion as shown by Example 3.

Example 3 (Cont)

We have CN(O 1 ) ={p, q, ¬s, t, u} and CN(O 2 ) ={p, q, ¬s, t}. Thus, Let us now introduce the concept of free part of a theory T = (F, S, D). It is the subtheory that is made of the set of facts, the set of strict rules and the defeasible rules which areinvolvedineverypreferredoptionofT .

CN(O 2 ) ⊆ CN(O 1
Definition 11 (Free sub-theory)T h efree sub-theory of a theory T = (F, S, D) is

Free(T ) = (F, S, (F,S,D i )∈POpt(T ) D i ).
The following result summarizes some basic properties of this sub-theory.

Property 8 Let T be a theory.

• For any O ∈ POpt(T ), Free(T ) ⊑ O • CN(Free(T )) is consistent

Rule-based argumentation systems

In this section, we propose an instantiation of Dung's framework that allows reasoning about defeasible information, i.e., drawing conclusions from a theory T = (F, S, D).T he instantiation is referred to as argumentation system keeping thus the term framework for the abstract formalism of Dung. The backbone of an argumentation system is naturally the notion of argument. Intuitively, an argument is a justification of a claim, i.e., it provides evidence that the claim is true. Thus, it should satisfy at least the three following basic properties:

(i) internal coherence, (ii) relevance to the claim it justifies and (iii) truth preserving (i.e., it guarantees the truth of the claim). It is true that humans' arguments may be inconsistent, but they are seen as fallacious by reasonable people. Furthermore, the topic of the paper is not reasoning about humans' arguments. It is rather reasoning about inconsistent theories by using arguments as a building block of the proposed logic.

Definition 12 (Argument)LetT = (F, S, D) be a theory. An argument defined from T is apair(d, x) such that:

• x ∈ L • d is a derivation schema for x from T (Truth preserving) • Seq(d) is consistent (Internal coherence) • ∄T ′ ⊏ (Facts(d), Strict(d), Def(d)) such that x ∈ CN(T ′ ) (Relevance) An argument (d, x) is strict iff Def(d) =∅.
Example 1 (Cont) Below are the nine arguments that are built from the theory T 1 .

• ( ( p,σ) , p)

• ( (q,σ) , q)

• ( ( p,σ),(q, r 6 ) , q)

• ( ( p,σ),(s, r 1 ) , s)

• ( (q,σ),(¬s, r 2 ) , ¬s)

• ( ( p,σ),(q, r 6 ), (¬s, r 2 ) , ¬s)

• ( ( p,σ),(s, r 1 ), (u, r 3 ) , u) • ( (q,σ),(¬s, r 2 ), (t, r 4 ) , t)

• ( ( p,σ),(q, r 6 ), (¬s, r 2 ), (u, r 3 ) , t)

Note that there is no argument in favor of v since all derivation schemas for v are inconsistent.

Derivations (4)and( 5) do not give birth to arguments since they are not minimal. The following result shows that an argument provides a minimal derivation schema for a conclusion.

Theorem 1 Let T be a theory. For any consistent sequence d = (x 1 , r 1 ),...,(x n , r n ) from T , the following two statements are equivalent:

• (d, x) is an argument (from T )
• d is a focused derivation schema from T such that x = x n An argument may have several sub-parts, each of which may give birth to an argument, called sub-argument of the original argument.

Notations

The function Sub(.) returns the set of all sub-arguments of a given argument.

Example 1 (Cont) The argument ( (q,σ),(¬s, r 2 ) , ¬s) has two sub-arguments: ( (q,σ) , q) and itself. By contrast, ( (q,σ) , q) is not a sub-argument of ( ( p,σ), (q, r 6 ) , q). ⊓ ⊔

Property 9 If (d, x) is a sub-argument of (d ′ , x ′ ),thenSeq(d) ⊆ Seq(d ′ ).
The converse is not true as shown next.

Example 5 Consider the two arguments a and b:

• a = ( ( p,σ),(t, p → t) , t) • b = ( ( p,σ),(q, p → q), (t, q ⇒ t) , t)
Note that Seq(a) ={p, t}⊆{p, q, t}=Seq(b) but a is not a sub-argument of b since the theory ({ p}, { p → t},σ)is not a sub-theory of ({ p}, { p → q}, {q ⇒ t}).

Argumentation systems that use a Tarskian logic such as propositional logic may have infinite sets of arguments even when the theories (called knowledge bases) over which they are built are themselves finite (cf. [START_REF] Amgoud | Identifying the core of logic-based argumentation systems[END_REF]). We show that this is not the case for rule-based argumentation systems. Indeed, the sets of arguments are finite as soon as the theories are finite.

Proposition 2 If a theory T is finite, then Arg(T ) is finite. The set of arguments built from a given theory cannot be empty since the set of facts of a theory contains at least ⊤.

Property 10 Fo r a t h e o r y T = (F, S, D), Arg(T ) =∅.

The construction of arguments in all existing structured argumentation systems is a monotonic process. By structured systems, we mean argumentation systems that build their arguments from knowledge bases encoded in particular logics. These include ASPIC [START_REF] Amgoud | Towards a consensual formal model: inference part. Deliverable of ASPIC project 9. Prakken H[END_REF],

ASPIC+ [9], DeLP [START_REF] García | Defeasible logic programming: an argumentative approach[END_REF], ABA [START_REF] Bondarenko | An abstract argumentation-theoretic approach to default reasoning[END_REF] and those discussed in [START_REF] Amgoud | Logical limits of abstract argumentation frameworks[END_REF]. Thus, unlike Dung's framework where arguments are abstract entities, in structured systems arguments have a clear origin and a precise structure. Hunter studied in [START_REF] Hunter | Base logics in argumentation[END_REF] the properties of the logics underlying existing structured systems. The results show that the set of arguments built from a knowledge base cannot be shrunk when the base is extended by new information. The following result shows that this property holds also for the kind of logic discussed in this paper.

Proposition 3 Let T and T ′ be two theories.

If T ⊑ T ′ ,thenArg(T ) ⊆ Arg(T ′ ).
A rule-based instantiation of Dung's abstract framework is defined as follows:

Definition 14 (Argumentation system)Anargumentation system defined over a theory T = (F, S, D) is a pair H = (Arg(T ), R) where Arg(T ) is the set of arguments built from T in the sense of Definition 12 and R ⊆ Arg(T ) × Arg(T ) is an attack relation.

For the sake of generality, the attack relation of an argumentation system is left unspecified in the sequel. Thus, it may be instantiated in different ways. In existing rule-based argumentation systems like the ASPIC system as defined in [START_REF] Amgoud | Towards a consensual formal model: inference part. Deliverable of ASPIC project 9. Prakken H[END_REF][START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF] and its extended version ASPIC+

[9], three kinds of attack relations are used: (i) rebut, initially proposed in [START_REF] Elvang-Gøransson | Acceptability of arguments as 'logical uncertainty[END_REF], which requires that two arguments have opposite conclusions, (ii) assumption attack, proposed also in [START_REF] Elvang-Gøransson | Acceptability of arguments as 'logical uncertainty[END_REF],

according to which an argument undermines a premise of another argument, and (iii) undercut, proposed in [START_REF] Pollock | How to reason defeasibly[END_REF], which allows an argument to prevent the application of a defeasible rule in another argument. The two first relations are conflict-dependent, i.e., they capture the inconsistency of the theory over which an argumentation system is built. Such relations should show no attack from argument a to b unless their derivation schemas contain opposite literals.

Definition 15 (Conflict-dependency)L e tH = (Arg(T ), R) be an argumentation sys-

tem. The attack relation R is conflict-dependent iff for all (d, x), (d ′ , x ′ ) ∈ Arg(T ),i f (d, x) R (d ′ , x ′ ) then Seq(d) ∪ Seq(d ′ ) is inconsistent.
An important feature of conflict-dependent attack relations is that they do not admit selfattacking arguments, mainly since arguments are consistent.

Proposition 4 Let H = (Arg(T ), R) be an argumentation system. If R is conflictdependent, then for all a ∈ Arg(T )(a, a)/ ∈ R.

Conflict-dependency is somehow related to the notion of conflict-freeness of sets of arguments. Indeed, when the attack relation is conflict-dependent, the set of arguments built from any consistent theory is conflict-free with respect to this relation.

Proposition 5 Let H = (Arg(T ), R) be an argumentation system built over a theory T .

For every A consequence of this property is that the set Arg(Free(T )) is admissible (i.e., it is conflict-free and defends all its elements). We will show in a subsequent section that this result is crucial for characterizing ideal extension.

T ′ ⊑ T ,i fCN(T ′ ) is consistent and R is conflict-dependent, then Arg(T ′ ) is conflict-free.
Theorem 2 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that CN((F, S, ∅)) is consistent. If R is conflict-dependent and privileges strict arguments, then Arg(Free(T )) is an admissible set of H.

Unless stated otherwise, in what follows we do not make any assumption about the attack relation of a rule-based argumentation system. However, the arguments of the latter are evaluated using any of the semantics recalled in Definition 3. The extensions of a system are used for defining the plausible conclusions to be drawn from the theory over which the system is built. A literal is a plausible conclusion of a system iff it is a common conclusion to all the extensions.

Definition 17 (Plausible conclusions)LetH = (Arg(T ), R) be an argumentation system built over a theory T .Thesetofplausible conclusions of H under semantics x is

Output(H) = {z ∈ L |∀E ∈ Ext x (H), ∃a ∈ E s.t. Conc(a) = z} if Ext x (H) =∅ ∅ else
The set of plausible conclusions coincides with the set of common conclusions of the extensions, of course when extensions exist.

Property 11 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that Ext x (H) =∅where x is any of the reviewed semantics. The equality Output(H) =

E i ∈Ext x (H) Concs(E i ) holds.
Finally, it is obvious that the plausible conclusions of an argumentation system are consequences of the theory over which it is built.

Property 12 Let H = (Arg(T ), R) be

an argumentation system built over a theory T .The inclusion Output(H) ⊆ CN(T ) holds under any extension-based semantics.

It is worth noticing that under admissible semantics, the set of plausible conclusions of any argumentation system is empty. This is mainly due to the fact that the empty set is always an admissible extension. This makes this semantics unsuitable for defeasible reasoning.

Complete semantics suffers from the same problem. Indeed, since under this semantics extensions are not maximal for set inclusion, the empty set may be an extension leading thus to an empty set of plausible conclusions. Stable semantics may also be unsuitable for argumentation systems that do not have extensions. However, we show in a subsequent section that rule-based systems that satisfy some desirable properties do have stable extensions, in particular when the attack relation is conflict-dependent.

Postulates for rule-based argumentation systems

Like any reasoning model, argumentation systems should enjoy some desirable properties or rationality postulates that ensure their soundness. The first work on postulates in argumentation was done by [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF] in the context of rule-based systems. Starting from the observation that some existing systems like those proposed in [START_REF] Governatori | Argumentation semantics for defeasible logic[END_REF][START_REF] Prakken | Argument-based extended logic programming with defeasible priorities[END_REF] suffer from two main problems: (i) returning inconsistent sets of plausible conclusions and (ii) forgetting intuitive conclusions, the authors proposed three postulates which prevent the encountered problems. In what follows, we recall the three postulates and propose three new ones. The first postulate proposed in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF] concerns the consistency of the set of conclusions supported by every extension.

Postulate 1 (Consistency) An argumentation system H = (Arg(T ), R) built over a theory

T = (F, S, D) satisfies consistency under semantics x iff for any E ∈ Ext x (H), Concs(E) is consistent.
A rule-based system which satisfies this postulate has necessarily a consistent set of plausible conclusions.

Property 13 [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF] If an argumentation system H = (Arg(T ), R) satisfies consistency under semantics x (x being any extension-based semantics), then Output(H) is consistent.

The second postulate ensures a form of "completeness" of the outputs of an argumentation system. It says that if there is an argument with conclusion x in an extension of the system, and there exists a strict rule x → y in the theory over which the system is built, then y should also be supported by an argument in the same extension. Recall that a strict rule has no exception. Thus, as soon as x is true, y holds for sure.

Postulate 2 (Closure under strict rules) An argumentation system H = (Arg(T ), R) built over a theory T = (F, S, D) is closed under strict rules under semantics x iff for any

E ∈ Ext x (H), Concs(E) = CN((Concs(E), S, ∅)).
If an argumentation system is closed under strict rules, then its set of plausible conclusions is also closed under strict rules.

Property 14 [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF] Let H = (Arg(T ), R) be an argumentation system built over a theory

T = (F, S,

D).IfH is closed under strict rules under semantics x (x being any extensionbased semantics), then Output(H) = CN((Output(H), S, ∅)).

A third postulate, called indirect consistency, was proposed in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF]. It ensures that every closed (under strict rules) extension should satisfy consistency. It was shown that a system that satisfies consistency and closure under strict rules satisfies this form of indirect consistency.

Property 15 [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF] Let H = (Arg(T ), R) be an argumentation system built over a theory In any axiomatic approach, the axioms (or postulates) should ideally all be independent from each other, i.e., none is deduced from the others. Thus, in the sequel indirect consistency is abandoned since it follows from Postulates 1 and 2. We propose next three new postulates which were already defined in [START_REF] Amgoud | Postulates for logic-based argumentation systems[END_REF] for argumentation systems that use a logic in the sense of [START_REF] Tarski | Logic, semantics, metamathematics[END_REF]. The first one says that if an argument belongs to an extension, then all its sub-arguments should be in the extension. Thus, an argument cannot be accepted if one of its sub-parts is questionable. This is a natural requirement since plausible conclusions inferred from a theory rely on their supporting arguments which should be unassailable.

Postulate 3 (Closure under sub-arguments) An argumentation system H = (Arg(T ), R)

built over a theory T = (F, S, D) is closed under sub-arguments under semantics x iff for

any E ∈ Ext x (H),ifa∈ E then Sub(a) ⊆ E.
Argumentation systems that satisfy both consistency and closure under sub-arguments enjoy a strong version of consistency. Indeed, the set of consequences that follow from the theory of an extension is consistent.

Proposition 6 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that Ext x (H) =∅(x being any extension-based semantics). If H satisfies consistency and closure under sub-arguments, then for any

E ∈ Ext x (H), CN(Th(E)) is consistent.
Let us illustrate this result with an example.

Example 6 Let T 5 = (F 5 , S 5 , D 5 ) be a theory such that S 5 =∅and

F 5 x ¬x D 5 x ⇒ y (r 1 ) ¬x ⇒ z (r 2 )
Consider the two arguments (d 1 , y), (d 2 , z) with d 1 = (x,σ),(y, r 1 ) and d 2 =

(¬x,σ),(z, r 2 ) . Assume that the set E ={(d 1 , y), (d 2 , z)} is an extension of (Arg(T 5 ), R)

under a given semantics. Clearly, CN((Concs(E), S, ∅)) ={ y, z} is consistent. However,

Th(E) = T and CN(T ) ={x, ¬x, y, z} is inconsistent. Proposition 6 ensures that the argumentation system (Arg(T 5 ), R) violates at least one of the consistency or closure under sub-arguments postulates.

Since facts and strict rules are the certain part in a theory (facts being observable and strict rules having no exceptions), they should be plausible conclusions of any argumentation system. It is worth mentioning that this principle is applied, for instance, in default logic

where the non-defeasible information of a default theory is part of all extensions [START_REF] Reiter | A logic for default reasoning[END_REF]. Of course this makes sense when the non-defeasible information is consistent.

Postulate 4 (Strict precedence) An argumentation system H = (Arg(T ), R) built over a theory T = (F, S, D) satisfies strict precedence under semantics x iff CN((F, S, ∅)) ⊆

Output(H).

Notice that argumentation systems that have no extensions violate this postulate. Similarly, systems that evaluate their arguments using a semantics which considers the empty set as an extension (like admissible semantics) violate strict precedence. Such systems are thus not suitable for defeasible reasoning since they may miss intuitive conclusions. We show next that if an argumentation system satisfies consistency and strict precedence, then the strict part of the theory over which it is built is consistent.

Proposition 8 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that Ext x (H) =∅ .I fH satisfies consistency and strict precedence under semantics x, then CN((F, S, ∅)) is consistent.

The last postulate ensures a form of completeness of the extensions of an argumentation system under any semantics. It says that if the sequence of an argument is part of the conclusions of a given extension, then the argument should belong to the extension. Informally: If each step in the argument is good enough to be in the extension, then so is the argument itself. It is worth pointing out that this postulates holds for both strict and defeasible rules.

Postulate 5 (Exhaustiveness) An argumentation system H = (Arg(T ), R) built over a theory T = (F, S, D) satisfies exhaustiveness under semantics x iff for any E ∈ Ext x (H),

for any (d, x) ∈ Arg(T ),ifSeq(d) ⊆ Concs(E),then(d, x) ∈ E.
Argumentation systems that satisfy exhaustiveness and closure under sub-arguments have complete extensions, i.e., they are closed in terms of arguments.

Proposition 9 Let H = (Arg(T ), R) be an argumentation system such that Ext x (H) =∅

(x being any extension-based semantics). If H is closed under sub-arguments and satisfies exhaustiveness under semantics x, then for all

E ∈ Ext x (H), E = Arg(Th(E)).
When an argumentation system satisfies strict precedence and exhaustiveness, then its strict arguments are part of any extension. This holds under any extension-based semantics.

Proposition 10 Let H = (Arg(T ), R) be an argumentation system such that Ext(H) =∅

(under an extension-based semantics). If H satisfies exhaustiveness and strict precedence, then for any E ∈ Ext(H), Arg((F, S, ∅)) ⊆ E.

An axiomatic approach should obey an important feature: The postulates should be compatible, i.e., they can be satisfied all together by an argumentation system under a given semantics. Fortunately, this is the case of the five postulates discussed in this section.

Proposition 11

The five postulates are compatible.

The four postulates (consistency, closure under sub-arguments, closure under strict rules, strict precedence) are independent. None of them follows from a subset of the three others.

However, as will be shown in the next section, exhaustiveness follows from consistency and closure under sub-arguments when an argumentation system uses a conflict-dependent attack relation and naive or stable semantics for evaluating arguments.

Outcomes of rule-based argumentation systems

This section analyzes the outputs of rule-based argumentation systems under the reviewed semantics, i.e., those recalled in Definition 3, that are suitable for defeasible reasoning. Recall that complete semantics is not a good candidate for such reasoning since its extensions are not maximal (for set inclusion) and may thus lead to an empty set of plausible conclusions, and missing intuitive conclusions. We analyze the extensions under each semantics. Indeed, we characterize the set Concs(.) of conclusions and the theory Th(.) of each extension. We also characterize the set Output(.) of plausible conclusions that are drawn by a rule-based argumentation system from a theory.

Note that the argumentation system described in Sect. 4 is not fully specified since its attack relation is left undefined and may thus be instantiated in different ways. For the purpose of our study, we do not need to consider a particular attack relation. Since any reasonable argumentation system should satisfy the discussed postulates, throughout this section we only focus on systems that satisfy the postulates. Such systems exist and ASPIC, defined in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF], is one of them. Indeed, it was shown in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF] that ASPIC, which uses restricted rebut as attack relation, satisfies consistency and closure under both sub-arguments and strict rules under all Dung's semantics. Furthermore, the attack relation in ASPIC privileges strict arguments (by definition) and the strict part of a theory is assumed to be consistent. Thus, the system satisfies strict precedence under the same semantics. Finally, from our Proposition 15 (respectively Proposition 13), it follows that it also satisfies exhaustiveness under stable (respectively naive) semantics. The results we provide next hold for any instantiation of the attack relation R. This means that whatever the attack relation that is considered, the outcome will be the same. This shows also that all the reasonable rule-based argumentation systems that can be built over the same theory are equivalent [START_REF] Amgoud | On the equivalence of logic-based argumentation systems[END_REF][START_REF] Oikarinen | Characterizing strong equivalence for argumentation frameworks[END_REF], in the sense they provide the same extensions and the set of plausible conclusions under a given semantics.

Before presenting the formal results concerning the reviewed semantics, below are some results that hold under any extension-based semantics, thus under all the reviewed semantics but also under several other semantics (e.g., recursive semantics [START_REF] Baroni | SCC-recursiveness: a general schema for argumentation semantics[END_REF], the one used in DeLP system [START_REF] García | Defeasible logic programming: an argumentative approach[END_REF], stage semantics [START_REF] Verheij | Two approaches to dialectical argumentation: Admissible sets and argumentation stages[END_REF], …). The first result characterizes the set of conclusions of each extension of an argumentation system which is closed under sub-arguments.

Proposition 12 Let H = (Arg(T ), R) be an argumentation system such that Ext(H) =

∅ (under an extension-based semantics). If H is closed under sub-arguments, then for any

E ∈ Ext(H), • Concs(E) = X ∪{Head(r ) | r ∈ Y ∪ Z } where Th(E) = (X, Y, Z ) • Concs(E) = CN(Th(E)) •∀ (d, x) ∈ Arg(Th(E)), Seq(d) ⊆ Concs(E)
The next result shows that if an argumentation system over a theory satisfies strict precedence, closure under both sub-arguments and strict rules, then the set of literals deduced from Th(E), the theory of an extension E, is exactly the same set that is obtained from Th(E)

extended by all facts and strict rules which are not in Th(E). We also show that the theory of an extension can be extended into a sub-theory (of the argumentation system) which infers, using the notion of derivation, all the conclusions that are supported by arguments of the extension. This (i.e., Theorem 4) will be useful in proving various results in the next sections.

Naive semantics

Before characterizing the extensions as well as the plausible conclusions of a rule-based argumentation system, let us first show some additional links between the postulates in the particular case of naive semantics. The first result shows that exhaustiveness follows from consistency and closure under sub-arguments. This is the case when the attack relation is conflict-dependent.

Proposition 13 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent. If H satisfies consistency and closure under sub-arguments under naive semantics, H satisfies exhaustiveness under naive semantics.

The second result shows that when an argumentation system is closed under sub-arguments and satisfies the consistency postulate under naive semantics, then every naive extension of the system is closed in terms of arguments.

Proposition 14 Let H = (Arg(T ), R) be an argumentation system built over a theory

T such that R is conflict-dependent and H satisfies consistency and closure under subarguments under naive semantics. For any E ∈ Ext n (H), E = Arg(Th(E)).

Strict precedence is problematic in case of naive semantics since it may be violated by a rule-based argumentation system. This is mainly due to the fact that the orientation of attacks is not taken into account when computing naive extensions; thus, there is no way to enforce the postulate. We show next that strict arguments are part of any naive extension only when they neither are attacked nor attack any argument.

Theorem 5 Let H = (Arg(T ), R) be an argumentation system built over a theory T =

(F, S, D) such that R is conflict-dependent. For any E ∈ Ext n (H), Arg((F, S, ∅)) ⊆ E iff
for any a ∈ Arg((F, S, ∅)), ∄b ∈ Arg(T ) such that aRborbRa.

We have previously shown that the five postulates are compatible in the general case.

Indeed, under stable and preferred semantics, it was shown that the ASPIC system satisfies all the postulates. In case of naive semantics, this is not always true. Strict precedence is not compatible with consistency when the strict part is inconsistent, or it is consistent but in conflict with the defeasible part. For instance, any argumentation system built over the In case of the ASPIC system, the argument b cannot be strict since the strict part (i.e., CN(F, S, ∅)) is assumed to be consistent. Moreover, there is only one conflict between a and b and which emanates from a since strict arguments cannot be attacked by defeasible ones.

Thus, strict precedence is violated.

We show next that, assuming consistency and closure under sub-arguments, naive extensions are maximal.

Theorem 7 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under sub-arguments

under naive semantics. For all E, E ′ ∈ Ext n (H),ifConcs(E ′ ) ⊆ Concs(E) then E = E ′ .
The following theorem characterizes naive extensions. It says that every naive extension of an argumentation system which satisfies consistency and closure under sub-arguments has a unique corresponding maximal option in the theory at hand. We prove that no two naive extensions return the same option. Moreover, every extension is exactly the set of all arguments that can be built from its corresponding option.

Theorem 9 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under sub-arguments under naive semantics.

• Fo r a l l E, E ′ ∈ Ext n (H),ifOption(E) = Option(E ′ ),thenE = E ′ • For any E ∈ Ext n (H), E = Arg(Option(E))
We have shown that each naive extension captures exactly one maximal option and it supports all, and only, the consequences of that option. Theorem 10 states that every maximal option has a corresponding naive extension. So, there is a bijection from the set of naive extensions to the set of maximal options. From the previous results, it follows that there is a bijection between the set of naive extensions of an argumentation system and the maximal options of the theory over which the system is built.

Corollary 1 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under sub-arguments under naive semantics. There is a bijection between Ext n (H) and Max(Opt(T )).

The previous results require only the satisfaction of two postulates: consistency and closure under sub-arguments. We show next that when a rule-based argumentation system satisfies all the five postulates, there is a bijection between the set of naive extensions of the system and the maximal preferred options of the theory over which it is built. The reason is that in such a case, the maximal options of the theory coincide with the maximal preferred ones.

Recall that in general, maximal preferred options may be different from maximal options. It follows also that when a theory is finite, then any system built over it has a finite number of naive extensions.

Corollary 4 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under sub-arguments under naive semantics. If T is finite, then H has a finite number of naive extensions.

What about the plausible conclusions that are drawn from a theory using an argumentation system that satisfies the postulates? From the previous results, it is easy to show that they are the literals that follow from all the maximal options. Let us summarize the main results: under naive semantics, any rule-based argumentation system may violate strict precedence. However, the other postulates can be satisfied. In such a case , if the attack relation is conflict-dependent, then any argumentation system will infer exactly the literals that follow from all the maximal options of the theory over which the system is built. This is due to the bijection that holds between the set of naive extensions and the set of maximal options. In case the system satisfies also strict precedence and closure under strict rules, then the maximal options of the theory coincide with the maximal preferred options.

Stable semantics

As for naive semantics, exhaustiveness follows from consistency and closure under subarguments in case of stable semantics.

Proposition 15 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent. If H satisfies consistency and closure under sub-arguments under stable semantics, then the following two properties hold:

• H satisfies exhaustiveness under stable semantics.

• For any E ∈ Ext s (H), E = Arg(Th(E)).
Stable extensions of rule-based argumentation systems satisfying the five postulates return maximal preferred options. This means that if one instantiates Dung's framework and does not get maximal preferred options with stable extensions, then the instantiation certainly violates at least one of the postulates. Note that strict precedence may be satisfied by an argumentation system under stable semantics while it is violated by the same system under naive semantics. This is due to the fact that the orientation of attacks plays an important role in stable semantics, then strict precedence can be enforced by choosing an appropriate orientation.

Theorem 13 Let H = (Arg(T ), R) be an argumentation system defined over a theory T such that R is conflict-dependent. If H satisfies consistency, strict precedence and closure under both sub-arguments and strict rules under stable semantics, and Ext s (H) =∅,then

for any E ∈ Ext s (H), there exists a unique option O ∈ Max(POpt(T )) such that:

• Th(E) ⊑ O • Concs(E) = CN(O) • E = Arg(O)
Two stable extensions cannot capture the same maximal preferred option. Tarskian logic for representing information and for computing arguments, it was shown in [START_REF] Amgoud | Logical limits of abstract argumentation frameworks[END_REF] that this equality depends on the attack relation that is chosen. We show next that this is also the case for rule-based systems.

Given T ,letℜ s be the set of all attack relations that are conflict-dependent and that ensure the five postulates under stable semantics: A consequence of this postulate is that stable extensions coincide with semi-stable ones.

ℜ s ={ R ⊆ Arg(T ) × Arg(T ) | R is conflict-
Indeed, it was shown in [START_REF] Caminada | Semi-stable semantics[END_REF] that when stable extensions exist, they coincide with semi-stable extensions.

Corollary 5 For all argumentation system H = (Arg(T ), R),i fR ∈ℜ s 2 ∪ℜ s 3 ,t h e n

Ext s (H) = Ext ss (H).

From the previous results, it is possible to delimit the number of stable extensions of rule-based argumentation systems that satisfy the five postulates.

Corollary 6 Let H = (Arg(T ), R) be an argumentation system defined over a theory T such that R is conflict-dependent. If H satisfies the five postulates, then

1 ≤|Ext s (H)|≤|Max(POpt(T ))|.
It follows that when a theory is finite, any argumentation system built over it has a finite number of stable extensions.

Corollary 7 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies the five postulates. If T is finite, then H has a finite number of stable extensions.

Attack relations of category ℜ s 2 induce a bijection between the set of stable extensions of an argumentation system and the set of maximal preferred options of the theory over which the system is built. Indeed, every preferred option gives a stable extension. In case an argumentation system satisfies strict precedence under naive semantics (see Theorem 5), then its extensions coincide with the stable ones. To put differently, in case naive semantics can guarantee strict precedence, stable semantics becomes useless since it provides no added value with respect to naive semantics.

Max(POpt(T 3 )) ={ O 1 , O 3 }.
Theorem 18 For all argumentation system H = (Arg(T ), R) such that R ∈ℜ s 2 ,i fH satisfies the postulates under naive semantics, then

Ext n (H) = Ext s (H) = Ext ss (H) = Ext p (H).
Plausible conclusions of rule-based argumentation systems that use attack relations in category ℜ s2 are exactly the literals that follow from all the maximal preferred options of the theory at hand.

Theorem 19

Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R ∈ℜ s 2 .

Output(H) =

O i ∈ Max(POpt(T ))

CN(O i ).

Systems that use relations in ℜ s 3 choose a proper subset of the maximal preferred options of T and make inferences from them. Their output sets are as follows:

Theorem 20 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R ∈ℜ s 3 .

Output(H) = O i ∈X CN(O i ) with X ={O i ∈ Max(POpt(T )) | E i = Arg(O i ) ∈ Ext s (H)}.
These attack relations introduce a critical discrimination between the maximal preferred options of a theory. Hence, great care must be exercised when designing rule-based argumentation systems based on stable semantics: The principles governing the interaction between ⇒ and R must be both rigorously and meticulously specified so as to avoid trouble of which the following example is an easy case.

u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard

Example 7 Consider T 6 such that F 6 , S 6 , D 6 are as follows:

F 6 p q S 6 =∅ D 6 p ⇒ s (r 1 ) q ⇒¬s (r 2 )
The theory T 6 has two maximal preferred options:

• O 1 = (F 6 , S 6 , {r 1 }) • O 2 = (F 6 , S 6 , {r 2 })
For a system H whose attack relation is in ℜ s 3 either (i) Arg(O 1 ) or (ii) Arg(O 2 ) is its unique stable extension. In case (i), s ∈ Output(H) and ¬s / ∈ Output(H).

In case (ii), ¬s is the plausible conclusion. By the obvious symmetry (don't be misled by negation! 1 ), either choice would be arbitrary, and this is an instance where an attack relation from ℜ s 2 is alright.

To sum up, attack relations satisfying the postulates can be split into two categories: ℜ s 2 and ℜ s 3 . Relations from ℜ s 2 make semi-stable semantics and preferred semantics to collapse into stable semantics. They offer no added value with respect to the latter. Stable semantics may, however, be more valuable than naive semantics. Indeed, the theories for which strict precedence cannot be satisfied under naive semantics are handled correctly under stable semantics. This latter can enforce the satisfaction of strict precedence if the attack relation is defined in an appropriate way. For those theories where the postulate is satisfied, stable semantics collapses into naive semantics. With attack relations from category ℜ s 3 , pitfalls threaten as preferred options are discarded, and a lot of care must be exercised when designing such an argumentation system.

Preferred semantics

Preferred semantics was originally proposed in order to overcome the limitation of stable semantics which does not guarantee the existence of extensions. Indeed, any argumentation system has at least one preferred extension which may be empty. We show that in case of rule-based systems the empty set cannot be an extension.

Theorem 21 Let H be an argumentation system built over a theory T = (F, S, D) such that H satisfies the strict precedence postulate under preferred semantics. Ext p (H) ={∅}.

Unlike the cases of naive and stable extensions, a preferred extension may capture a proper sub-part of a maximal preferred option. For instance, it is not impossible that a preferred extension captures only the strict part of theory T 6 in Example 7.

Theorem 22 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies the five postulates under preferred semantics. For

any E ∈ Ext p (H), ∃O ∈ Max(POpt(T )) such that Th(E) ⊑ O and Concs(E) ⊆ CN(O).
Each preferred extension corresponds to exactly one maximal preferred option. It either returns all the consequences of that option, or chooses a subset. The latter contains all the conclusions that follow from the strict part and some conclusions that follow using defeasible rules. We show next that there is at least one maximal preferred option which is captured by a preferred extension. This is mainly due to the fact that stable extensions exist. 1 There is an apparent asymmetry between s and ¬s but it is meaningless because we can choose an atom t to represent the intuitive statement formalized by ¬s and then the intuitive statement formalized by s gets represented as ¬t. As an illustration about numbers, by letting odd instead of even, or vice versa, to be an atom of L, asymmetry about negation could be reversed, while in both cases the meaning would be the same.

then E = E ′ .
We show next that the free part of a theory, i.e., the sub-theory, which consists of the set of facts, the set of strict rules and the defeasible rules which are involved in every preferred option, is part of any preferred extension of argumentation systems that satisfy the postulates.

Indeed, the set Arg(Free(T )) is part of every preferred extension of any argumentation system which satisfies consistency, exhaustiveness, strict precedence and closure under subarguments.

Theorem 25 Let H = (Arg(T ), R) be an argumentation system over a theory T = (F, S, D) such that R is conflict-dependent and privileges strict arguments (recall Definition [START_REF] Pollock | How to reason defeasibly[END_REF], and H satisfies consistency, exhaustiveness, strict precedence and closure under sub-arguments under preferred semantics.

Arg(Free(T ))

⊆ E i ∈Ext p (H) E i .
From the previous results, it follows that the number of preferred extensions does not exceed the number of maximal preferred options of the theory over which the system is built.

Theorem 26 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies the five postulates under preferred semantics.

1 ≤|Ext p (H)|≤|Max(POpt(T ))|
When a theory is finite, any argumentation system built over it has a finite number of preferred extensions.

Corollary 8 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies the five postulates under preferred semantics. If

T is finite, then H has a finite number of preferred extensions.

Let us now characterize the plausible conclusions that are drawn from a theory T by an argumentation system H satisfying the rationality postulates under preferred semantics. Let ℜ p be the set of all attack relations that ensure the postulates under preferred semantics:

ℜ p ={ R ⊆ Arg(T ) × Arg(T ) | R is conflict-dependent and (Arg(T ), R)
satisfies the five postulates under preferred semantics}.

In his seminal paper [START_REF] Dung | On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games[END_REF], Dung has shown that the stable extensions of an argumentation system are also preferred extensions of the system. Consequently, the set ℜ p is a subset of ℜ s .

Property 16 ℜ p ⊆ℜ s .

Then, ℜ p contains three disjoint subsets of attack relations: ℜ p =ℜ p 1 ∪ℜ p 2 ∪ℜ p 3 :

•ℜ p 1 : the relations which are in ℜ p ∩ℜ s 1 .

•ℜ p 2 : the relations which are in ℜ p ∩ℜ s 2 .

•ℜ p 3 : the relations which are in ℜ p ∩ℜ s 3 .

Let us analyze each category of attack relations separately. The first set is empty (i.e., ℜ p 1 =∅) since we have shown previously that there is no attack relation which prevents an argumentation system from having stable extensions (ℜ s 1 =∅).

Attack relations of category ℜ p 2 lead to coherent argumentation systems (i.e., Ext s (H) =

Ext p (H)) as shown in Theorem 17. Thus, preferred semantics does not provide an added value with respect to stable semantics. Moreover, there is a bijection between the two sets:

Ext p (H) and Max(POpt(T )).

Corollary 9 Let H = (Arg(T ), R) be an argumentation system over a theory T such that R ∈ℜ p 2 .

• For any E ∈ Ext p (H), ∃O ∈ Max(POpt(T )) such that Concs(E) = CN(O) and

Th(E) ⊑ O. • For any O ∈ Max(POpt(T )), Arg(O) ∈ Ext p (H). • For any O ∈ Max(POpt(T )), O = Option(Arg(O)).
In the case of attack relations of category ℜ p 2 , Arg(Free(T )) is equal to the intersection of all preferred extensions.

Theorem 27 Let H = (Arg(T ), R) be an argumentation system over a theory T .IfR ∈ ℜ p 2 ,then

Arg(Free(T )) = E i ∈Ext x (H) E i
where x ∈{p, s, ss}.

The output of an argumentation system is in this case the same as under stable semantics, i.e., the plausible conclusions given in Theorem 19.

Let us now analyze attack relations of category ℜ p 3 . Remember that in this case stable semantics chooses only some maximal preferred options of the theory at hand. Four situations may be encountered:

1. The stable extensions and the preferred extensions of an argumentation system coincide.

Thus, preferred semantics has no added value with respect to stable semantics. Moreover, it may lead to arbitrary results as discussed in the previous subsection when R ∈ℜ s 3 (see Example 7 where one of the defeasible rules is chosen in an arbitrary way).

2. The preferred extensions consider additional but not all maximal preferred options (other than the ones chosen by stable semantics). This case is similar to the previous one, and the argumentation system may return arbitrary results. Note that Example 7 is not sufficient to show this case since stable semantics will return one of O 1 and O 2 while preferred semantics will return the second one, which corresponds more to the case above. In order to exemplify this case, consider the following theory Example 8 Consider T 7 such that F 7 , S 7 , D 7 are as follows:

F 7 p t S 7 =∅ D 7 ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩ p ⇒ q (r 1 ) q ⇒ s (r 2 ) t ⇒¬s (r 3 ) t ⇒¬q (r 4 )
The theory T 7 has three maximal preferred options:

• O 1 = (F 7 , S 7 , {r 1 , r 2 }) • O 2 = (F 7 , S 7 , {r 1 , r 3 }) • O 3 = (F 7 , S 7 , {r 3 , r 4 })
Assume that Arg(O 1 ) is the single stable extension of an argumentation system H = (Arg(T 7 ), R) which satisfies the five postulates. Thus, Arg(O 1 ) is also a preferred extension of H. Case 2 suggests either Arg(O 2 ) or Arg(O 3 ) (not both) is another preferred extension. Thus, as in Example 7, some rules are discarded in an arbitrary way.

3. The preferred extensions return all the maximal preferred options of the theory. This means that stable semantics chooses some maximal preferred options and preferred semantics considers the remaining ones. This case coincides exactly with the case of attack relations of category ℜ p 2 (see Theorem 19). Indeed, the argumentation system returns all the conclusions that follow from all maximal preferred options of the theory.

Note that this output is also ensured by stable semantics when R ∈ℜ s2 .

4. Some of the preferred extensions provide proper sub-parts of maximal preferred options.

In this case, the result of the argumentation system may be arbitrary as can be seen on the following example.

Example 8 (Cont) Consider an argumentation system H = (Arg(T 7 ), R) such that R ∈ ℜ p 3 . Assume that H has two preferred extensions: E 1 and E 2 . From Theorem 23, one of them captures necessarily a maximal preferred option. Let E 1 be such extension, and let

Option(E 1 ) = O 1 . Case 4 suggests that there is at least another preferred extension, say

E 2 such that Option(E 2 ) ⊏ O i (i = 2, 3). Assume that i = 2andTh(E 2 ) = (F 7 , S 7 , {r 3 }).
Note that since preferred extensions are maximal for set inclusion, it cannot be the case that Th(E 2 ) = (F 7 , S 7 , {r 1 }) (since E 2 would be a subset of E 1 ). One can notice that among the four rules, r 4 is not used, which is unjustified.

To sum up, attack relations of category ℜ p 3 may lead either to arbitrary results or to results which can be provided by stable semantics.

Grounded: ideal semantics

This section analyzes the outcomes of rule-based systems under grounded and ideal semantics. Recall that both semantics ensure only one extension, which may be empty, for an argumentation system. Moreover, the grounded extension GE(H) of an argumentation system H is a sub-part of the ideal extension IE(H) of the same system. Consequently, the conclusions supported by the former are also supported by the latter, i.e., Concs(GE(H)) ⊆

Concs(IE(H)). Note also that the output set of an argumentation system is exactly

Concs(GE(H)) (respectively Concs(IE(H))) in case of grounded (respectively ideal)

semantics. Before presenting the formal results, it is worth mentioning that an argumentation system that satisfies the postulates under preferred semantics does not necessarily satisfy the postulates under grounded/ideal semantics. Similarly, a system that satisfies the postulates The ideal extension, introduced in [START_REF] Dung | Computing ideal skeptical argumentation[END_REF], is a maximal (for set inclusion) admissible set that is a subset of each preferred extension. In case of a rule-based argumentation system which satisfies the postulates, it returns a sub-part of one of the preferred options of the theory over which the system is built. Formally: Note that the outcome under ideal semantics may be arbitrary. This is in particular the case when the semantics selects one preferred option and draws all the conclusions that follow from this option. However, when the attack relation is of category ℜ p 2 and privileges strict arguments (recall Definition 16), then the ideal extension is exactly the set Arg(Free(T )).

Theorem
Theorem 29 If an argumentation system H satisfies the five postulates under ideal semantics and R ∈ℜ p 2 and privileges strict arguments, then IE(H) = Arg(Free(T )).

The above result shows that ideal semantics allows the inference of literals only from the free part of a theory.

Corollary 10 If an argumentation system H satisfies the five postulates under ideal semantics and R ∈ℜ p 2 and privileges strict arguments, then Output(H) = CN(Free(T )).

Note that in this case grounded extension may be more cautious than ideal one and may miss intuitive (free) conclusions since GE(H) ⊆ Arg(Free(T )).

The grounded extension of any argumentation system which satisfies the postulates under grounded semantics captures a sub-part of a preferred option, i.e., it behaves exactly like ideal extension.

Theorem 30 If an argumentation system

Related work

The abstract argumentation framework proposed by Dung [START_REF] Dung | On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games[END_REF] was used for reasoning about defeasible information, and more generally for handling inconsistency. It was thus instantiated in different ways, considering different logical languages for representing information.

Examples of such languages are propositional language (e.g., [START_REF] Amgoud | Inferring from inconsistency in preference-based argumentation frameworks[END_REF][START_REF] Gorogiannis | Instantiating abstract argumentation with classical logic arguments: postulates and properties[END_REF]) and rule-based ones (e.g., [START_REF] Amgoud | Towards a consensual formal model: inference part. Deliverable of ASPIC project 9. Prakken H[END_REF]9,[START_REF] Amgoud | An argumentation system for defeasible reasoning[END_REF][START_REF] Bondarenko | An abstract argumentation-theoretic approach to default reasoning[END_REF][START_REF] Prakken | Argument-based extended logic programming with defeasible priorities[END_REF][START_REF] Amgoud | A formal analysis of logic-based argumentation systems[END_REF]).

All the instantiations are defined in a similar way: define arguments and attacks, then apply Dung's semantics on the defined graph, and infer the formulas that follow from all extensions. Some of these works are incomplete since there is one important step which is missing: characterizing the set of inferences that are drawn from a theory/knowledge base, i.e., describing formally how the output relates to the theory.

For filling this gap, in [START_REF] Amgoud | Logical limits of abstract argumentation frameworks[END_REF], we considered argumentation systems that use Tarskian logics, covering thus the systems studied in [START_REF] Amgoud | Inferring from inconsistency in preference-based argumentation frameworks[END_REF][START_REF] Gorogiannis | Instantiating abstract argumentation with classical logic arguments: postulates and properties[END_REF]. In [START_REF] Amgoud | An argumentation system for defeasible reasoning[END_REF][START_REF] Amgoud | A formal analysis of logic-based argumentation systems[END_REF], we focused on rule-based logics.

Here we faced two issues: First, the logical languages that are considered in the literature A formal characterization of the outcomes of rule-based… are different. In ASPIC [START_REF] Amgoud | Towards a consensual formal model: inference part. Deliverable of ASPIC project 9. Prakken H[END_REF], defeasible rules express defaults and any uncertain information. In ABA [START_REF] Bondarenko | An abstract argumentation-theoretic approach to default reasoning[END_REF], uncertain information is encoded by assumptions. In ASPIC+ [9], several types of information are considered (axioms, ordinary premises, issues, assumptions, strict rules and defeasible rules). The differences between all these types are unclear, especially between strict rules and axioms (both represent certain and non-defeasible information), and between ordinary premises, assumptions and defeasible rules (which all represent uncertain and defeasible information). Consequently, we have chosen the logical language used in the ASPIC system [START_REF] Amgoud | Towards a consensual formal model: inference part. Deliverable of ASPIC project 9. Prakken H[END_REF][START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF]. It considers facts and strict rules (for encoding strict information) and defeasible rules (for encoding assumptions, defeasible rules, ordinary premises). Another issue with rule-based argumentation systems is that there are two types of attack relations:

inconsistency-based ones and undercut which amounts to blocking the application of defeasible rules. For a better understanding of each type of attack relation, we studied in [START_REF] Amgoud | An argumentation system for defeasible reasoning[END_REF] argumentation systems that use undercut as their sole attack relation, and in this paper we studied the impact of inconsistency-based ones.

Our formalism uses the same logical language as ASPIC and a more general inconsistencybased attack relation. Our results apply thus to ASPIC when its undercut relation is empty.

Note that our results and those from [START_REF] Amgoud | An argumentation system for defeasible reasoning[END_REF] should be combined for characterizing the outcomes of the ASPIC system when it uses the two kinds of relations. This is left for future work.

ASPIC+ uses a "richer" logical language since its aim was to unify all existing argumentation systems. It can thus be seen a union of several elementary systems: ABA for dealing with assumptions, ASPIC for dealing with strict/defeasible information, and the systems defined in [START_REF] Amgoud | Logical limits of abstract argumentation frameworks[END_REF] for dealing with Tarskian logics. In [START_REF] Amgoud | Logical limits of abstract argumentation frameworks[END_REF], we have characterized this sub-class of ASPIC+. In this paper, we characterized the sub-class capturing ASPIC.

The last well-known argumentation system, called ABA, cannot be compared to our formalism since the two systems use different logical languages. While ABA uses assumptions for capturing the defeasible information in a theory, our formalism uses defeasible rules.

Conclusion

The paper provides the first investigation on the outputs of rule-based argumentation systems that use inconsistency-based attack relations. The study is general in the sense that it keeps the attack relation unspecified. Thus, the system can be instantiated with any of the attack relations that are used in existing systems. The results show that under naive semantics, the systems return the literals that follow from all the options of the theory at hand. Stable and preferred semantics either do not provide an added value with respect to naive semantics or the attack relation of a system should be formalized in a very rigorous way in order to avoid arbitrary results. Ideal semantics returns the free part of a theory, whereas the grounded semantics returns a sub-part of the free part meaning that it may miss interesting conclusions.

Acknowledgements The authors are very grateful to the reviewers for their many insightful comments. (-→ ) Let us assume that there exist x i and x j such that x i = x j but i = j.

Appendix: Proofs

Clearly, we can further assume i < j without loss of generality. For each (x k , r k )

in d where k > j, x j ∈ Body(r k ) is trivially equivalent to x i ∈ Body(r k )
hence Body(r k ) ⊆{x 1 ,...,x j-1 , x j+1 ,...,x k-1 }. Therefore, (x 1 , r 1 ),...,(x j-1 , r j-1 ), (x j+1 , r j+1 ),...,(x n , r n ) is also a derivation schema, but it is a proper subsequence of d, a contradiction arises. Now, let us assume that d fails to be focused. There exists i ∈{ 1,...,n -1} such that x i / ∈ Body(r j ) for every j > i. Consequently, (x 1 , r 1 ),...,(x i-1 , r i-1 ), (x i+1 , r i+1 ),...,(x n , r n ) is also a derivation schema for x in T , contradicting the minimality of d. for some j > k.So,(x j , r j ) is in (x k+1 , r k+1 ),...,(x n , r n ) .Asd ′ is a derivation schema,

Body(r j ) ⊆{x 1 ,...,x k-1 } (remember, d ′ is a subsequence of (x 1 , r 1 ),...,(x k-1 , r k-1 ), (x k+1 , r k+1 ),...,(x n , r n ) ). Hence, x k ∈{x 1 ,...,x k-1 }.Thatis,x 1 ,...,x n are not pairwise distinct. ⊓ ⊔
Proof of Property 3 Let T = (F, S, D) be a theory.

• The inclusions CN(T ) ⊆ F ∪{ Head(r ) | r ∈ S ∪ D}⊆L follow trivially from Definition 6.

• If T is finite, then F , S, D are finite. Thus, the set F ∪{Head(r

) | r ∈ S ∪ D} is finite.
From the first item, CN(T ) is finite.

• For any x ∈ F , the sequence (x,σ) is a derivation schema for x from T . Thus,

x ∈ CN(T ) and this proves the inclusion F ⊆ CN(T ).

•⊤∈CN(T ) since ⊤∈F and F ⊆ CN(T ).

• Assume that F ={ ⊤ }and ∄r ∈ D such that Body(r ) ={ ⊤ } . Thus, since the body of any other rule in T is assumed to be non-empty, no rule in S ∪ D can be applied, hence

CN(T ) ={ ⊤ } .C o n v e r s e l y ,i fCN(T ) ={ ⊤ } ,t h e nF ={ ⊤ }(since F ⊆ CN(T ))a n d
∄r ∈ D such that Body(r ) ={⊤}(since each such rule is applicable when it exists).

• Let d = (x 1 , r 1 ),...,(x n , r n ) be a derivation schema for x ∈ L from T .FromDefinition 6, for each x i (i = 1,...,n), there exists a derivation schema from T for x i . Thus,

Seq(d) ⊆ CN(T ). ⊓ ⊔ Proof of Property 4 Let T = (F, S, D) and T ′ = (F ′ , S ′ , D ′ ) be two theories such that T ⊑ T ′ .Letx ∈ CN(T ). So,
CN(Free(T )) ⊆ CN(O).SinceCN(O) is consistent, then so is for CN(Free(T )). ⊓ ⊔ Proof of Property 9 Let (d, x) be a sub-argument of (d ′ , x ′ ).L e tx i ∈ Seq(d).
T h e r ea r e two possibilities:

• x i ∈ Facts(d), thus x i ∈ Facts(d ′ ) since Facts(d) ⊆ Facts(d ′ ).S o ,x i ∈ Seq(d ′ ). • x i = Head(r ) with r ∈ Strict(d) ∪ Def(d); thus, r ∈ Strict(d ′ ) ∪ Def(d ′ ) since Strict(d) ⊆ Strict(d ′ ) and Def(d) ⊆ Def(d ′ ).So,x i ∈ Seq(d ′ ).
Ext(H) =∅. Let x ∈ Output(H). Thus, for all E ∈ Ext(H), ∃a ∈ E such that Conc(a) = x.I t follows that x ∈ Concs(E i ), ∀E i ∈ Ext(H) and hence x ∈ E i ∈Ext(H) Concs(E i ). Assume now that x ∈ E i ∈Ext(H) Concs(E i ). Thus, ∀E i , ∃a i ∈ E i such that Conc(a i ) = x. Consequently, x ∈ Output(H). ⊓ ⊔
Proof of Property 12 Let H = (Arg(T ), R) be an argumentation system built over a theory T .Letx ∈ Output(H). From Definition 17, ∃(d, x) ∈ Arg(T ). From Definition 12, d is a derivation for x from T . Thus, x ∈ CN(T ).

⊓ ⊔

Proof of Property 16 Let R ∈ℜ p and let H = (Arg(T ), R) be a rule-based argumentation system built over a theory T = (F, S, D).SinceH satisfies the five postulates, thus for all

E ∈ Ext p (H), • Concs(E) is consistent • Concs(E) = CN(Concs(E), S, ∅) • For all a ∈ E, Sub(a) ⊆ E • for all (d, x) ∈ Arg(T ),ifSeq(d) ⊆ Concs(E),then(d, x) ∈ E.
From Property 1, Ext s (H) ⊆ Ext p (H), then for all E ∈ Ext s (H), E satisfies the above four properties. Thus, H satisfies consistency, exhaustiveness and closure under both subarguments and strict rules. Let us now show that it also satisfies strict precedence under stable semantics. From Property 11, Output(H) = E i ∈Ext p (H) Concs(E i ). Thus, for all E ∈ Ext p (H), Output(H) ⊆ Concs(E).S i n c eH satisfies strict precedence under preferred semantics, CN(F, S, ∅) ⊆ Concs(E). Thus, the property is satisfied by every stable extension.

⊓ ⊔ Proof of Proposition 1 Let T = (F, S, D).L e tO, O ′ ∈ Opt(T ) be such that CN(O) = CN(O ′ ).L e tO = (X, Y, Z ) and O ′ = (X ′ , Y ′ , Z ′ ).F o ra l lx ∈ X , x ∈ CN(O) and thus
x ∈ X ′ . The same holds for all x ′ ∈ X ′ . Thus, X = X ′ .

Let r ∈ Y ∪ Z . There are two cases: (i) Body(r ) CN(O). Consequently, Body(r )

CN(O ′ ). Thus, CN(O ′ ⊕ r ) is consistent. So, r ∈ Y ′ ∪ Z ′ (

⊓ ⊔

Proof of Proposition 11 In order to prove the compatibility of the postulates, it is sufficient to give an example of a system which satisfies all the five postulates. This system is ASPIC as defined in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF]. Proposition 1 in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF] shows that the system is closed under sub-arguments under any Dung's semantics. Proposition 8 in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF] shows that the system is closed under strict rules under complete semantics, thus under stable semantics. Property 2 in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF]shows that the system satisfies consistency under any Dung's semantics. From Proposition 13,the system satisfies exhaustiveness. Let us now show that the system satisfies strict precedence.

This follows from the definition of attack relation (Definition 16 in [START_REF] Caminada | On the evaluation of argumentation formalisms[END_REF]) according to which a strict argument cannot be attacked. Thus, it belongs to any stable extension. ⊓ ⊔

Proof of Proposition 12

Let H be an argumentation system such that Ext(H) =∅where

(x i , r i ) in d * ,ifi = k then either x i = x k or r i = r k .
For r k = σ , the former implies the latter hence r i = r k whenever i = k. Thus, depriving and x from T for some q < p.Let j be the greatest index from 1 ... p such that x * j is in Seq(d Proof Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D)

d * from (x k , r k )
Def(d ′ ) ⊆ Def(d),if(x ′ i , r ′ i ) is in d ′ with r ′ i = σ then there exists k such that (x k , r k ) is in d * where r k = r ′ i (also, x k = x ′ i because x ′ i = Head(r ′ i ) = Head(r k ) = x k ). Similarly, since Facts(d ′ ) ⊆ Facts(d),if(x ′ i , r ′ i ) is in d ′ with r ′ i = σ then there exists k such that (x k , r k ) is in d * where x ′ i = x k and r k = r ′ i = σ .Thatis,d ′
such that CN((F, S, ∅)) is consistent. Assume that R is conflict-dependent and privileges strict arguments. for x from (F, S, Z ). There are two cases:

• For any i = 1,...,n, r i ∈{σ }∪Y ∪ Z . Hence, d is also a derivation schema for x from (F, Y, Z ). Thus, x ∈ CN((F, Y, Z )).

• There exists 1 < i ≤ n such that r i ∈ S\Y (note that the two theories (F, Y, Z ) and (F, S, Z ) differ only on S\Y ). Let i be the first step where an element of S\Y is used in the derivation d. Note also that i > 1 since strict rules have non-empty bodies. Thus, for any j < i, r j ∈{σ }∪Y ∪ Z and (x 1 , r 1 ),...,(x j , r j ) is a derivation schema of x j from (F, Y, Z ). Thus, x j ∈ CN((F, Y, Z )). Furthermore, Body(r i ) ⊆{x 1 ,...,x i-1 },so for x from (F, S, Z ∪ Z ′ ). There are two cases:

Body(r i ) ⊆ CN((F, Y, Z )).SinceConcs(E) = CN(Th(E)), Body(r i ) ⊆ Concs(E).
• For any i = 1,...,n, r i ∈{σ }∪S ∪ Z . Hence, d is also a derivation schema for x from (F, S, Z ). Thus, x ∈ CN((F, S, Z )), and from (1), x ∈ Concs(E).

• Assume that there exists 1 < i ≤ n such that r i ∈ Z ′ (note that the two theories (F, S, Z )

and (F, S, Z ∪ Z ′ ) differ only on Z ′ ). Let i be the first step where an element of Z ′ is used in the derivation d. Since the bodies of defeasible rules are not empty, i > 1. It follows that for any j < i, r i ∈{σ }∪S ∪ Z , thus (x 1 , r 1 ),...,(x j , r j ) is a derivation schema of x j from (F, S, Z ). Thus, x j ∈ CN((F, S, Z )). Furthermore, by Definition 6, Body(r i ) ⊆{x 1 ,...,x i-1 }. Then, Body(r i ) ⊆ CN((F, S, Z )). This contradicts the fact that r i ∈ Z ′ and thus such r i does not exist. (d,x) is an argument. In addition Proof Let H = (Arg(T ), R) be an argumentation system built over a theory T such that

(d, x)/ ∈ E. Then, ∃(d ′ , x ′ ) ∈ E such that (d, x)R(d ′ , x ′ ) or (d ′ , x ′ )R(d, x).S i n c eR is conflict-dependent, then Seq(d) ∪ Seq(d ′ ) is inconsistent. But, Seq(d ′ ) ⊆ Concs(E).

  options, preferred options are options that contain the strict part. Should not all preferred Definition 1 (Argumentation framework)A nargumentation framework is a pair H = (A, R) where A is a non-empty (possibly infinite) set of arguments and R ⊆ A × A is an attack relation. A pair (a, b) ∈ R means that a attacks b.AsetE ⊆ A attacks an argument b iff ∃a ∈ E such that (a, b) ∈ R. Notation We sometimes use the infix notation aRb to denote (a, b) ∈ R.

123Journal: 10115

 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f

Definition 4 (

 4 Theory)Atheory is a triple T = (F, S, D) where F ={⊤}∪X , with X ⊆ L, is a set of facts, and S ⊆ L ′ (respectively D ⊆ L ′ ) is a set of strict (respectively defeasible) rules' names. T is finite iff all three sets F , S and D are finite. Note that ⊤ is a fact in any theory. Note also that the two sets S and D contain names of rules and not the corresponding rules themselves. Throughout the paper, (F, S, ∅) is referred to as the strict part of a theory T = (F, S, D).u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard

123Journal: 10115

 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard

Proposition 1

 1 Fo r a l l O, O ′ ∈ Opt(T ),ifCN(O) = CN(O ′ ),thenO = O ′ . 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based…

123Journal: 10115

 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based…

Notations

  Let T be a theory, Arg(T ) denotes the set of all arguments built from T in the sense of Definition 12.Ifa = (d, x) is an argument, then Conc(a) = x.F ora set E of arguments, Concs(E) ={ x | (d, x) ∈ E} and Th(E) is a theory such that

Definition 13 (

 13 Sub-argument) An argument (d, x) is a sub-argument of (d ′ , x ′ ) iff (Facts(d), Strict(d), Def(d)) ⊑ (Facts(d ′ ), Strict(d ′ ), Def(d ′ )).

123Journal: 10115

 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard

123Journal: 10115 Definition 16 (

 1011516 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based… Another feature of all the attack relations in existing rule-based argumentation systems is the fact that they privilege strict arguments. Strict argument precedence)L e tH = (Arg(T ), R) be an argumentation system built over a theory T . An attack relation R privileges strict arguments iff for all a = (d, x), b = (d ′ , x ′ ) ∈ Arg(T ),ifa is strict and Seq(d) ∪ Seq(d ′ ) is inconsistent, then aRb.

123Journal: 10115

 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard

T

  = (F, S, D).IfH satisfies consistency and is closed under strict rules under semantics x (x being any extension-based semantics), then for any E ∈ Ext x (H), CN((Concs(E), S, ∅)) is consistent. It is worth mentioning that the three previous results hold for any attack relation and under any extension-based acceptability semantics, thus under any of the semantics recalled in Definition 3 and others like recursive semantics [20]. 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based…

Proposition 7

 7 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that ∅∈Ext x (H). H violates strict precedence under semantics x. 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard

123

  Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based…

Theorem 3

 3 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that Ext(H) =∅(under an extension-based semantics). If H satisfies strict precedence and closure under both strict rules and sub-arguments, then for any E ∈ Ext(H), CN (Th(E)) = CN

123

  Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard Theorem 4 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that Ext(H) =∅(under an extension-based semantics). If H satisfies strict precedence, and closure under both strict rules and sub-arguments, then for any E ∈ Ext(H), Concs(E) = CN(O) for O = (F, S,ζ)such that ζ = ⎛ ⎝ (d,x)∈E Def(d) ⎞ ⎠ ∪ r | r ∈ D and Body(r ) CN(Th(E)) .

  theory of Example 3 will violate at least one of the two postulates under naive semantics. Theorem 6 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that R is conflict-dependent. If ∃a, b ∈ Arg(T ) such that a ∈ Arg((F, S, ∅)) and Conc(a) =¬ Conc(b),thenH cannot satisfy both strict precedence and consistency under naive semantics. 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based…

Theorem 10

 10 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under sub-arguments under naive semantics.• For any O ∈ Max(Opt(T )), Arg(O) ∈ Ext n (H) • For any O ∈ Max(Opt(T )), O = Option(Arg(O)) • Fo r a l l O, O ′ ∈ Max(Opt(T )),ifArg(O) = Arg(O ′ ) then O = O ′123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard Example 3 (Cont) The theory T 3 has seven options, of which only two are maximal: Max(Opt(T 3 )) ={ O 4 , O 5 }. For all argumentation system H built over T 3 , if the attack relation of H is to be conflict-dependent and consistency and closure under sub-arguments satisfied, then Ext n (H) ={Arg(O 4 ), Arg(O 5 )}.

Theorem 11 Corollary 2 Corollary 3

 1123 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency, strict precedence and closure under both strict rules and sub-arguments under naive semantics. The equality Max(POpt(T )) = Max(Opt(T )) holds. Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency, strict precedence and closure under both strict rules and sub-arguments under naive semantics. There is a bijection betweenExt n (H) and Max(POpt(T )).It is possible to delimit the number of naive extensions of any argumentation system that satisfies consistency and closure under sub-arguments. It is exactly the number of maximal options of the theory at hand. Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under sub-arguments under naive semantics. The equality |Ext n (H)|=|Max(Opt(T ))| holds.

Theorem 12

 12 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under sub-arguments under naive semantics.Output(H) =O i ∈Max(Opt(T )) CN(O i ) 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based… Example 3 (Cont) Any argumentation system H that can be built over the theory T 3 and has a conflict-dependent attack relation and satisfies consistency and closure under sub-arguments will have as output the set Output(H) = CN(O 4 ) ∩ CN(O 5 ) ={p, q, t, u,v}.

Theorem 14

 14 Let H = (Arg(T ), R) be an argumentation system defined over a theory T such that R is conflict-dependent. If H satisfies consistency, strict precedence and closure under both sub-arguments and strict rules under stable semantics and Ext s (H) =∅ ,thenfor all E, E ′ ∈ Ext s (H),ifOption(E) = Option(E ′ ) then E = E ′ .The previous results characterize the stable extensions of rule-based argumentation systems that satisfy the postulates. However, they do not guarantee that each maximal preferred 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard option of a theory has a corresponding stable extension. To put it differently, it does not guarantee a bijection between the sets Ext s (H) and Max(POpt(T )) and thus does not ensure the equality |Ext s (H)|=| Max(POpt(T ))|. In case of argumentation systems that use a

Theorem 16

 16 Let H = (Arg(T ), R) be an argumentation system over a theory T such that R ∈ℜ s 2 . For any O ∈ Max(POpt(T )), Arg(O) ∈ Ext s (H).

123Journal: 10115

 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based… Example 3 (Cont) The theory T 3 has seven options, of which only two are preferred maximal:

T 7 . 123 Journal: 10115

 12310115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based…

123

  Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o funder ideal semantics may violate some of the postulates under grounded semantics. That is why in the following we study each semantics separately.

28

 28 If an argumentation system H satisfies the five postulates under ideal semantics, then there exists a preferred option O ∈ POpt(T ) such that Th(IE(H)) ⊑ O and CN((F, S, ∅)) ⊆ Concs(IE(H)) ⊆ CN(O).

  H satisfies the five postulates under grounded semantics, then there exists a preferred option O ∈ POpt(T ) such that Th(GE(H)) ⊑ O and CN((F, S, ∅)) ⊆ Concs(GE(H)) ⊆ CN(O).

123Journal: 10115

 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f

Proof of Property 2

 2 Let T = (F, S, D) be a theory and x ∈ L.Letd = (x 1 , r 1 ),...,(x n , r n ) be a derivation schema for x from T . 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f

(

  ←-) Let us assume that d fails to be minimal although d is focussed and the literals x 1 ,...,x n are pairwise distinct. As d is not minimal, there exists a proper subsequence d ′ of d which is a derivation schema for x in T . Let us write (x k+1 , r k+1 ),...,(x n , r n ) for the largest common final subsequence of d and d ′ .Now ,k exists (and k > 0) because d ′ is a proper subsequence of d.Asd ′ is a derivation schema for x n and d ′ is a subsequence of d and x 1 ,...,x n are pairwise distinct, k < n ensues. Since d is focussed, x k ∈ Body(r j )

  there exists a derivation schema d = (x 1 , r 1 ),...,(x n , r n ) for x from T .S i n c eT ⊑ T ′ , Facts(d) ⊆ F ′ and Strict(d) ⊆ S ′ and Def(d) ⊆ D ′ . Therefore, d is also a derivation schema for x from T ′ . ⊓ ⊔ Proof of Property 5 The two properties follow trivially from the definition of option. ⊓ ⊔ Proof of Property 6 The inclusion POpt(T ) ⊆ Opt(T ) follows trivially from Definitions 9 and 10. Assume that CN(T ) is consistent. From Property 5, Opt(T ) ={T }.Since(F, S, ∅) ⊑ T , POpt(T ) ={ T }. Assume now that Opt(T ) ⊆ POpt(T ).S i n c eOpt(T ) =∅ ,f o ra l l O ∈ Opt(T ) it holds that O ∈ POpt(T ). Thus, for all O ∈ Opt(T ), (F, S, ∅) ⊑ O.I t 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based… follows that (F, S, ∅) ⊑ Free(T ). 2 Assume that CN(T ) is inconsistent. Then, there exists a minimal conflict 2 C = (X, Y, Z ) ⊑ T .Since(F, S, ∅) ⊑ Free(T ), X = Y =∅ .But, by assumption, the body of every defeasible rule is not empty. Thus, CN(C) =∅ .T h i s contradicts the fact that CN(C) is inconsistent. ⊓ ⊔ Proof of Property 7 Let T = (F, S, D) be a theory. Assume that CN((F, S, ∅)) is consistent. Thus, there exists a preferred option O such that either (i) for all r ∈ D, CN((F, S, {r })) is inconsistent meaning that O = CN((F, S, ∅)) or (ii) there exists r ∈ D such that CN((F, S, {r })) is consistent thus (F, S, ∅) ⊏ O. In both cases, POpt(T ) =∅. Assume now that CN((F, S, ∅)) is inconsistent. Since F and S should be part of any preferred option and the set of consequences of a preferred option should be consistent, then POpt(T ) =∅. Let r ∈ D and assume that CN((F, S, {r })) is consistent. From Definition 10, (F, S, {r }) is either a preferred option (iff for all r ′ ∈ D such that r = r ′ , CN((F, S, {r, r ′ })) is inconsistent). Or, there exists a preferred option O = (F, S, {r }∪D ′ ) where D ′ ⊆ D\{r }. ⊓ ⊔ Proof of Property 8 Let T = (F, S, D) be a theory and Free(T ) = (F, S, D ′ ).F r o m the definition of Free(T ), Free(T ) ⊑ O for all O ∈ POpt(T ). From Property 4,

  10 Let T = (F, S, D) be a theory. Since ⊤∈F by Definition 4, ( ⊤,σ , ⊤) ∈ Arg(T ) and thus Arg(T ) =∅. ⊓ ⊔ Proof of Property 11 Let H = (Arg(T ), R) be an argumentation system over a theory T and Ext(H) its set of extensions under any extension-based semantics. Assume that

  by definition of an option).(ii) Body(r ) ⊆ CN(O). Consequently, Body(r ) ⊆ CN(O ′ ). Thus, CN(O ′ ⊕ r ) is consistent. So, r ∈ Y ′ ∪ Z ′ (by definition of an option).⊓ ⊔Proof of Proposition 2 If T is finite, then CN(T ) is finite (apply Property 3). Consequently,Arg(T ) is finite. ⊓ ⊔Proof of Proposition 3 Let T and T ′ be two theories such that T ⊑ T ′ .L e t(d, x) be an argument defined from T . All items in Definition 12 are independent from T except for d being a derivation schema for x from T . Hence, for (d, x) to be an argument defined from T ′ , it is enough that d be a derivation schema for x from T ′ . Now, this is equivalent tox ∈ CN(T ′ ). By Property 4, the latter follows from x ∈ CN(T ) (which is itself proved from the fact that d is a derivation schema for x from T ). Thus, (d, x) is an argument defined fromT ′ . ⊓ ⊔ Proof of Proposition 4 Let H = (Arg(T ), R) be an argumentation system such that R is conflict-dependent. Let a = (d, x) ∈ Arg(T ) be such that (a, a) ∈ R.SinceR is conflictdependent, Seq(d) is inconsistent. This is impossible since a is an argument (thus Seq(d)should be consistent).⊓ ⊔Proof of Proposition 5 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that CN(T ) is consistent and R is conflict-dependent. Assume that Arg(T )is not conflict-free. Thus, there exist(d, x), (d ′ , x ′ ) ∈ Arg(T ) such that (d, x)R(d ′ , x ′ ).Consequently, Seq(d)∪Seq(d ′ ) is inconsistent. Besides, from Property 3, Seq(d) ⊆ CN(T ) and Seq(d ′ ) ⊆ CN(T ). Thus, CN(T ) is inconsistent. Contradiction. ⊓ ⊔ Proof of Proposition 6 Let H be an argumentation system which satisfies consistency and closure under sub-arguments. From Proposition 12, ∀E ∈ Ext(H) Concs(E) = CN(Th(E)). Since H satisfies consistency, ∀E ∈ Ext(H) Concs(E) is consistent. Thus, so is for CN(Th(E)). ⊓ ⊔ Proof of Proposition 7 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that ∅∈Ext(H). Thus, Output(H) =∅ . Assume that H satisfies strict precedence, then CN((F, S, ∅)) ⊆ Output(H).Since⊤∈F and from Property 3,it holds that F ⊆ CN((F, S, ∅)),then⊤∈Output(H). ⊓ ⊔ 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based… Proof of Proposition 8 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D).

  Ext(H) is its set of extensions under an extension-based semantics. Assume that H is closed under sub-arguments and let E ∈ Ext(H) and Th(E) = (X, Y, Z ).• Let x ∈ Concs(E). Thus, ∃(d, x) ∈ E where d is a derivation for x from (Facts(d),Strict(d), Def(d)). From Property 3, x ∈ Facts(d) (thus x ∈ X ), or x = Head(r ) where r ∈ Strict(d) (thus r ∈ Y )orx ∈ Def(d) (thus x ∈ Z ). Assume now that x ∈ X . Thus, ∃(d, y) ∈ E such that x ∈ Facts(d). Besides, ( (x,σ) , x) is a sub-argument of (d, y).S i n c eH is closed under sub-arguments, ( (x,σ) , x) ∈ E, and thus, x ∈ Concs(E). Let r ∈ Y ∪ Z . Thus, ∃(d, x) ∈ E such that r ∈ Strict(d) ∪ Def(d).L e t d = (x 1 ,r 1 ),...,(x i , r ), (x i+1 , r i+1 )...,(x n = x, r n ) with x i = Head(r ). Thus, there exists a sub-sequence d ′ of d which is a derivation for x i . This derivation is minimal (for set inclusion since (d, x) is an argument). Thus, (d ′ , x i ) is an argument. Moreover, it is a sub-argument of (d, x).S i n c eH is closed under sub-arguments,(d ′ , x i ) ∈ E. Consequently, x i ∈ Concs(E). Thus, Concs(E) = X ∪{Head(r ) | r ∈ Y ∪ Z }.• From the definitions of the two functions Concs and Th, it follows that Concs(E) ⊆CN(Th(E)). From Property 3, CN(Th(E)) ⊆ X ∪{Head(r ) | r ∈ Y ∪ Z }.From above, CN(Th(E)) ⊆ Concs(E). • Assume now that a = (d, x) ∈ Arg(Th(E)).F o ra l lx i ∈ Seq(d), x i ∈ CN(Th(E)). Since H is closed under sub-arguments, CN(Th(E)) = Concs(E). Then, x i ∈ Concs(E). Thus, Seq(d) ⊆ Concs(E). ⊓ ⊔ 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard

  gives a derivation d ′ of x from T such that Facts(d ′ ) ⊆ Facts(d) and Strict(d ′ ) ⊆ Strict(d) and Def(d ′ ) ⊆ Def(d), with one of the latter two inclusions being strict. That is, there exists T ′ ⊏ (Facts(d), Strict(d), Def(d)) such that x ∈ CN(T ′ ), thereby contradicting Definition 12. The remaining case is r k = σ .Sinced * contains no repeated pair, no (x i , r i ) in d * is (x k ,σ)except for i = k and it follows that d * deprived from (x k , r k ) gives a derivation d ′ of x from T such that Facts(d ′ ) ⊂ Facts(d) while Strict(d ′ ) ⊆ Strict(d) and Def(d ′ ) ⊆ Def(d). As above, a contradiction arises.(←-) Assume that d is a focused derivation schema from T such that x n = x.B y the definitions, x ∈ L and d is a derivation schema for x from T . Due to the hypothesis in the statement of the theorem, Seq(d) is consistent. Assume that there existsT ′ = (F ′ , S ′ , D ′ ) ⊏ (Facts(d), Strict(d), Def(d)) such that x ∈ CN(T ′ ).Thatis,there exists a derivation d ′ = (x ′ 1 , r ′ 1 ),...,(x ′ m , r ′ m ) for some m < n such that Facts(d ′ ) =F ′ and Strict(d ′ ) = S ′ and Def(d ′ ) = D ′ .Letd * be a minimal derivation schema for x from T obtained from d by deleting all repeated pairs. Accordingly, Facts(d * ) = Facts(d) and Strict(d * ) = Strict(d) and Def(d * ) = Def(d).SinceStrict(d ′ ) ⊆ Strict(d)

  is a proper subsequence of a reordering of d * , thereby contradicting the minimality of d * . Indeed, let us show that no initial proper fragment of a reordering d * ι of d * is a minimal derivation of x. Assume a reordering d * ι = (x * ι1 , r * ι1 ),...,(x * ιp , r * ιp ) of d * = (x * 1 , r * 1 ),...,(x * p , r * p ) such that d ι = (x * ι1 , r * ι1 ),...,(x * ιq , r * ιq ) is a minimal derivation of

8 .

 8 Assume that ∃a = (d, x) ∈ Arg(Free(T )) and ∃b = (d ′ , x ′ ) ∈ Arg(T ) such that bRa or bRa.S i n c eR is conflict-dependent, Seq(d) ∪ Seq(d ′ ) is inconsistent and thus CN(Th({a})) ∪ CN(Th({b})) is inconsistent (since from Property 3, Seq(d) ⊆ CN(Th({a}))and Seq(d ′ ) ⊆ CN(Th({b}))).Let Th({a}) = (X, Y, Z ) and Th({b}) = (X ′ , Y ′ , Z ′ ). Let us show that CN((F, S, Z ′ )) is inconsistent. Assume that CN((F, S, Z ′ )) is consistent. Thus, there exists a preferred option O ∈ POpt(T ) such that (F, S, Z ′ ) ⊑ O.Since(X, Y, Z ) ⊑ Free(T ) and Free(T ) ⊑ O, (F, S, Z ∪ Z ′ ) ⊑ O. From Property 4, CN((F, S, Z ∪ Z ′ )) ⊆ CN(O).Thus, CN(O) is inconsistent. This contradicts the fact that O is an option. Let Z * be the smallest (for set inclusion) subset of Z ′ such that CN((F, S, Z * )) is inconsistent. Thus, for all r ∈ Z * , CN((F, S, Z * \{r })) is consistent. It follows that for all r ∈ Z * , there exists a preferred option O ∈ POpt(T ) such that (F, S, Z ∪ Z * \{r }) ⊑ O by Property Assume that for every strict a ′′ ∈ Sub(a), Seq(d ′′ ) ∪ Seq(d ′ ) is consistent. However, Seq(d) ∪ Seq(d ′ ) is inconsistent (since aRb or bRa while R is conflict-dependent). Hence, Head(Def(d)) ∪ Head(Def(d ′ )) is inconsistent, say y ∈ Head(Def(d)) and ¬y ∈ Head(Def(d ′ )). Should no such y be in F ∪Head(S), then there would be a preferred option O = (F, S, D O ) with ¬y ∈ Head(D O ). A contradiction arises, because a = (d, x) being in Arg(Free(T )) means that Def(d) is a subset of D O for every preferred option O = (F, S, D O ).That is, there exists a ′′ = (d ′′ , x ′′ ) ∈ Sub(a) such that a ′′ is strict and Seq(d ′′ ) ∪ Seq(d ′ ) is inconsistent. Since R privileges strict arguments, a ′′ Rb.⊓ ⊔Proof of Theorem 2 Let H = (Arg(T ), R) be an argumentation system built over a theoryT = (F, S, D) such that CN((F, S, ∅)) is consistent. Assume that R is conflict-dependentand privileges strict arguments.We show first that Arg(Free(T )) is conflict-free. From Property 8, CN(Free(T )) is consistent. Since R is conflict-dependent, from Proposition 5, Arg(Free(T )) is conflictfree.Let us now show that Arg(Free(T )) defends its elements. Assume that ∃a = (d, x) ∈ Arg(Free(T )) and ∃b = (d ′ , x ′ ) ∈ Arg(T ) such that bRa. From Lemma 1, there existsa ′ = (d ′′ , x ′′ ) ∈ Sub(a) such that a ′ is strict, hence a ∈ Arg(Free(T )),anda ′ Rb. ⊓ ⊔Proof of Theorem 3 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that Ext(H) =∅ . Assume that H satisfies strict precedence and closure under both strict rules and sub-arguments. Let E ∈ Ext(H) and Th(E) = (X, Y, Z ). Since X ⊆ F and Y ⊆ S, (X, Y, Z ) ⊑ (F, S, Z ). From Property 4, CN((X, Y, Z )) ⊆ CN((F, S, Z )). 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small u n c o r r e c t e d p r o o f L. Amgoud, P. Besnard Let us now show that CN((F, S, Z )) ⊆ CN((X, Y, Z )).S i n c eH satisfies strict precedence, CN((F, S, ∅)) ⊆ Output(H). From Property 11, Output(H) ⊆ Concs(E). Since H is closed under sub-arguments, Concs(E) = CN(Th(E)) by Proposition 12. Hence, CN((F, S, ∅)) ⊆ CN((X, Y, Z )). Furthermore, from Property 3, F ⊆ CN((F, S, ∅)). Thus, X = F , i.e., Th(E) = (F, Y, Z ).L e tx ∈ CN((F, S, Z )). Then, there exists a derivation schema d = (x 1 , r 1 ),...,(x n , r n )

  Since H is closed under strict rules, Head(r i ) ∈ Concs(E) = CN((F, Y, Z )), i.e., x i ∈ CN((F, Y, Z )). We repeat the same reasoning for showing that eachx i ∈ CN((F, Y, Z ))and conclude that x ∈ CN((F, Y, Z )).⊓ ⊔Proof of Theorem 4 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that H satisfies strict precedence, and closure under both strict rules and sub-arguments. Let E ∈ Ext(H) and Th(E) = (X, Y, Z ). From Theorem 3 and Proposition 12, it holds that CN(Th(E)) = CN((F, S, Z )) = Concs(E). (*) Let O = (F, S, Z ∪ Z ′ ) where Z ′ ={ r | r ∈ D\Z and Body(r ) CN(Th(E))}.Since (F, S, Z ) ⊑ O, then from Property 4 and (*), Concs(E) ⊆ CN(O). Let us now show that CN(O) ⊆ Concs(E).Letx ∈ CN((F, S, Z ∪ Z ′ )). Then, there exists a derivation schema d = (x 1 , r 1 ),...,(x n , r n )

⊓ ⊔ 123 Journal: 10115

 12310115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based…Proof of Theorem 5 Let H = (Arg(T ), R) be an argumentation system built over a theory

So,⎠Lemma 2 ⎠

 2 Seq(d) ∪ Seq(d ′ ) ⊆ CN(O). This contradicts the fact that O is an option. So, CN(O) ⊆ Concs(E). Since both Concs(E) ⊆ CN(O) and CN(O) ⊆ Concs(E) have now been proved, the required CN(O) = Concs(E) follows. Let us now show that O ∈ Max(Opt(T )). Assume that ∃O ′ ∈ Opt(T ) such that CN(O) ⊆ CN(O ′ ). Thus, ∃x ∈ CN(O ′ ) and x / ∈ CN(O). Thus, there exists a minimal derivation d for x from O ′ .SinceCN(O ′ ) is consistent and Seq(d) ⊆ CN(O ′ ) (from Property 3), (d, x) is an argument. In addition (d, x)/ ∈ E (since x / ∈ CN(O)). Then, ∃(d ′ , x ′ ) ∈ E such that (d, x)R(d ′ , x ′ ) or (d ′ , x ′ )R(d, x).SinceR is conflict-dependent, Seq(d) ∪ Seq(d ′ ) is inconsistent. But, Seq(d ′ ) ⊆ Concs(E).So,Seq(d)∪Seq(d ′ ) ⊆ CN(O ′ ). This contradicts the fact that O ′ is an option. 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small and Concs(Arg(O)) = CN(O ′ ).SinceConcs(Arg(O)) = CN(O) and using Proposition 12, Concs(Arg(O)) = CN(Th(Arg(O))),thenCN(Th(Arg(O))) = CN(O) and we get ∪ r | r ∈ D and Body(r ) CN(O) and CN(O) = CN(O ′ ). From Proposition 1, it follows that O = O ′ . Furthermore, O ∈ Max(Opt(T )) and is maximal (for set inclusion) up to consistency and contains the strict part of T ,thenO ∈ Max(POpt(T )).Let us now show that Max(POpt(T )) ⊆ Max(Opt(T )).LetO ∈ Max(POpt(T )).Bydefinition of preferred option, CN(O) is consistent. Since R is conflict-dependent,Arg(O) is conflict-free by Proposition 5. Assume now that Arg(O)/ ∈ Ext n (H). Thus, ∃a ∈ Arg(T )\Arg(O) such that Arg(O) ∪{a} is conflict-free. Consequently, ∃E ∈ Ext n (H) such that Arg(O) ∪{a}⊆E. Thus, Concs(Arg(O) ∪{a}) ⊆ Concs(E).SinceCN(O) is consistent, Concs(Arg(O)) = CN(O). Thus, CN(O)∪{Conc(a)}⊆Concs(E).FromTheorem 8, ∃O ′ ∈ Max(Opt(T )) such that Concs(E) = CN(O ′ ). Then, CN(O) ∪{Conc(a)}⊆ CN(O ′ ).T h i sm e a n st h a tO ′ ∈ POpt(T ) (since it contains all consequences of the strict part of T ). This contradicts the fact that O is a maximal preferred option. Consequently, Arg(O) ∈ Ext n (H). From Theorem 8, O ∈ Max(Opt(T )). ⊓ ⊔ Proof of Theorem 12 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under subarguments. From Property 11, Output(H) = E i ∈Ext n (H) Concs(E i ). From Theorem 8,for all E i ∈ Ext n (H), there exists a unique O i ∈ Max(Opt(T )) such that Concs(E i ) = CN(O i ). Also, Corollary 1 guarantees that Max(Opt(T )) does not have any additional elements that do not have a mapping in Ext n (H). Thus, Output(H) = O i ∈Max(Opt(T ))CN(O i ).⊓ ⊔ Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that R is conflict-dependent and H satisfies the five postulates. For any E ∈ Ext s (H), it holds that (F, S, Z ) ∈ Max(POpt(T )) ∪ r | r ∈ D and Body(r ) CN(Th(E)) .

R 2 and

 2 is conflict-dependent and H satisfies the five postulates. Let E ∈ Ext s (H) and Th(E) = (X, Y, Z ).LetO = (F, S, Z ∪ Z ′ ) where Z ′ ={r | r ∈ D\Z and Body(r ) CN(Th(E))}. Clearly, Th(E) ⊑ O. From Theorem 4, Concs(E) = CN(O).SinceH satisfies consistency, then Concs(E) is consistent, and thus, CN(O) is consistent as well. Since (F, S, ∅) ⊑ O and CN(O) is consistent, from Property 7, ∃O ′ ∈ POpt(T ) such that O ⊑ O ′ . From Proposition 3, Arg(Th(E)) ⊆ Arg(O) ⊆ Arg(O ′ ). From Proposition 9, E = Arg(Th(E)). Hence, E ⊆ Arg(O) ⊆ Arg(O ′ ).S i n c eR is conflict-dependent, CN(O) and CN(O ′ ) are consistent, then from Proposition 5 Arg(O) and Arg(O ′ ) are both conflict-free. From Property 1, E ∈ Ext n (H). Then, E is maximal (for set inclusion) among conflict-free sets. 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Thus, E = Arg(O) = Arg(O ′ ). From consistency of CN(O) and CN(O ′ ), it follows that Concs(Arg(O)) = CN(O) and Concs(Arg(O ′ )) = CN(O ′ ). Then, CN(O) = CN(O ′ ) and O ∈ POpt(T ).Let us now show that O ∈ Max(POpt(T )). Assume that ∃O ′ ∈ POpt(T ) such thatCN(O) ⊆ CN(O ′ ).SinceConcs(E) = CN(O), Concs(E) ⊆ CN(O ′ ).Letx ∈ CN(O ′ ) and x / ∈ Concs(E).SinceCN(O ′ ) is consistent, there exists an argument (d, x) ∈ Arg(O ′ ), i.e., d is a derivation of x from O ′ . Clearly, (d, x)/ ∈ E. Thus, ∃(d ′ , x ′ ) ∈ E such that (d ′ , x ′ )R(d, x). Since R is conflict-dependent, Seq(d)∪Seq(d ′ ) is inconsistent. But, Seq(d ′ ) ⊆ CN(Th(E))andSeq(d) ⊆ CN(O ′ ). Proposition 13 gives CN(Th(E)) = Concs(E). Then, CN(Th(E)) ⊆ CN(O ′ ). Finally, Seq(d) ∪ Seq(d ′ ) ⊆ CN(O ′ ). This contradicts the fact that CN(O ′ ) is consistent. ⊓ ⊔Proof of Theorem 13 Let H = (Arg(T ), R) be an argumentation system built over a theoryT such that R is conflict-dependent and H satisfies consistency, exhaustiveness, strict precedence and closure under both strict rules and sub-arguments. Assume that Ext s (H) =∅ .Let E ∈ Ext s (H) and Th(E) = (X, Y, Z ). From Lemma 2, the option O = (F, S, Z ′ ) ∈ Max(POpt(T )) with Z ′ = Z ∪{r | r ∈ D\Z and Body(r ) CN(Th(E))}.SinceX ⊆ F , Y ⊆ S and Z ⊆ Z ′ , Th(E) ⊑ O. From Theorem 4, Concs(E) = CN(O).Let us show that E has a unique corresponding preferred maximal option. Assume that∃O 1 , O 2 ∈ Max(POpt(T )) such that Th(E) ⊑ O 1 , Concs(E) = CN(O 1 ), Th(E) ⊑ O Concs(E) = CN(O 2 ). Obviously, CN(O 1 ) = CN(O 2 ).Ho we v er ,O 1 , O 2 ∈ POpt(T )according to Property 6 hence Proposition 1 givesO 1 = O 2 .Let us now show that E = Arg(O).SinceTh(E) ⊑ O, from Proposition 3, Arg(Th(E)) ⊆ Arg(O). From Proposition 15, E ⊆ Arg(O). Assume now that ∃a = (d, x) ∈ Arg(O) such that a / ∈ E. Thus, ∃b = (d ′ , x ′ ) ∈ E and bRa.S i n c eR is conflict-dependent, Seq(d) ∪ Seq(d ′ ) is inconsistent. Besides, Seq(d) ⊆ CN(O) and Seq(d ′ ) ⊆ CN(Th(E)).S i n c eH is closed under sub-arguments, CN(Th(E)) = CN(O) by Proposition 12. Thus, Seq(d) ∪ Seq(d ′ ) ⊆ CN(O). This contradicts the fact that O is an option. ⊓ ⊔ Proof of Theorem 14 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency, strict precedence and closure under both strict rules and sub-arguments. Assume that Ext s (H) =∅ .L e t E, E ′ ∈ Ext s (H). From Theorem 13, ∃O ∈ Max(POpt(T )) such that Concs(E) = CN(O)and∃O ′ ∈ Max(POpt(T )) such that Concs(E ′ ) = CN(O ′ ).IfO = O ′ ,thenConcs(E) = Concs(E ′ ). Assume that ∃a = (d, x) ∈ E\E ′ . Thus, ∃b = (d ′ , x ′ ) ∈ E ′ such that bRa. Since R is conflict-dependent, Seq(d) ∪ Seq(d ′ ) is inconsistent. But H isclosed under sub-arguments. Thus, Concs(E) = CN(Th(E)) and Concs(E ′ ) = CN(Th(E ′ )). Besides, Seq(d) ⊆ CN(Th(E)) and Seq(d ′ ) ⊆ CN(Th(E ′ )).S i n c eCN(Th(E ′ )) = CN(Th(E)), Seq(d) ∪ Seq(d ′ ) ⊆ CN(Th(E)). Thus, CN(Th(E)) is inconsistent. This contradicts the fact that H satisfies consistency. The same reasoning holds for a = (d ′ , x ′ ) ∈ E ′ \E. ⊓ ⊔ Proof of Theorem 15 Any argumentation system H = (Arg(T ), R) that satisfies strict precedence should have F as plausible conclusions, i.e., F ⊆ CN((F, S, ∅)) ⊆ Output(H). Since ⊤∈F,t h e nOutput(H) =∅ .H o w e v e r ,s i n c eR ∈ℜ s 1 , Ext s (H) =∅ . Thus, Output(H) =∅. ⊓ ⊔ Proof of Theorem 16 Let H = (Arg(T ), R) be an argumentation system over a theory T such that R ∈ℜ s 2 .L e tO ∈ Max(POpt(T )).S i n c e|Ext s (H)|=| Max(POpt(T ))|, from Theorems 13 and 14, ∃E ∈ Ext s (H) such that E = Arg(O), hence Arg(O) ∈ Ext s (H). ⊓ ⊔ 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small Author Proof u n c o r r e c t e d p r o o f A formal characterization of the outcomes of rule-based…

  Th(E) = (X, Y, Z ). From Theorem 4, Concs(E) = CN(O) where O = (F, S, Z ∪ Z ′ ) andZ ′ ⊆ D\Z . Clearly Th(E) ⊑ O. From consistency, Concs(E) is consistent. Then, CN(O)is consistent as well. Then, there existsO ′ ∈ Max(POpt(T )) such that O ⊑ O ′ . Therefore, CN(O) ⊆ CN(O ′ ). Thus, Concs(E) ⊆ CN(O ′ ). ⊓ ⊔ Proof ofTheorem 23 Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that R is conflict-dependent and H satisfies the five postulates under preferred semantics. Since Ext s (H) ⊆ Ext p (H), H satisfies the postulates under stable semantics. Consequently, from Theorem 15, Ext s (H) =∅.LetE ∈ Ext s (H).From Theorem 13, ∃O ∈ Max(POpt(T )) such that E = Arg(O). ⊓ ⊔ 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small

  Consider, for instance, the theory in Example 3. Its maximal options are O 4 and O 5 , while its maximal preferred options are O 1 and O 3 .

	L. Amgoud, P. Besnard
	Note that in general, maximal preferred options may be different from maximal options.
	u n c o r r e c t e d p r o o f

). ⊓ ⊔ Notations For a set B of theories, we denote the set of its maximal elements as Max(B) = {T ∈ B | ∄T ′ ∈ B such that CN(T ) CN(T ′ )}. 123 Journal: 10115 Article No.: 1227 TYPESET DISK LE CP Disp.:2018/6/7 Pages: 45 Layout: Small

  dependent and (Arg(T ), R) satisfies the five postulates under stable semantics for any theory T }.This set contains three disjoints subsets of attack relations, i.e., ℜ s =ℜ s 1 ∪ℜ s 2 ∪ℜ s 3 :•ℜ s 1 : the set of relations such that |Ext s (H)|=0 •ℜ s 2 : the set of relations such that |Ext s (H)|=|Max(POpt(T ))| •ℜ s 3 : the set of relations such that |Ext s (H)| < |Max(POpt(T ))|Let us analyze separately each category of attack relations. The following result shows that the set ℜ s 1 is empty, meaning that there is no attack relation which prevents the existence of stable extensions. To say it differently, any argumentation system which satisfies the postulates has at least one stable extension.

Theorem 15 ℜ s 1 =∅.

  Thus, for all argumentation system H built over T 3 ,i ft h e attack relation of H is of category ℜ s 2 ,t h e nExt s (H) ={ Arg(O 1 ), Arg(O 3 )}. Recall that under naive semantics, there is no argumentation system over T 3 that can satisfy strict precedence. The ones that guarantee consistency and closure under sub-arguments will all have the following naive extensions:Ext n (H) ={Arg(O 4 ), Arg(O 5 )}.Argumentation systems with an attack relation from ℜ s 2 are coherent, meaning that the preferred extensions exhaust all the stable ones. It follows thus that the three semantics (semistable, stable, preferred) coincide. This means that semi-stable and preferred semantics have no added value with respect to stable semantics since they guarantee the same results.Theorem 17 For any argumentation system H = (Arg(T ), R) such that R ∈ℜ s 2 , it holds Ext s (H) = Ext ss (H) = Ext p (H).

  Theorem[START_REF] Besnard | A logical analysis of rule inconsistency[END_REF] Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that R is conflict-dependent and H satisfies the five postulates under preferred semantics. There exists O ∈ Max(POpt(T )) such that Arg(O) ∈ Ext p (H). At least one of Arg(O 1 ) and Arg(O 2 ) is a preferred extension of an argumentation system H = (Arg(T 6 ), R) which satisfies the five postulates. Ext p (H) and O ∈ Max(POpt(T )).IfTh(E) ⊑ O and Th(E ′ ) ⊑ O,

	Example 7 (Cont) Two preferred extensions refer to different preferred options.
	Theorem 24 Let H = (Arg(T ), R) be an argumentation system such that R is conflict-
	dependent and H satisfies exhaustiveness and closure under sub-arguments under preferred
	semantics. Let E, E ′ ∈

  Assume that H satisfies consistency and strict precedence. From Property 13, it holds that Output(H) is consistent. From strict precedence, CN((F, S, ∅)) ⊆ Output(H). Thus, CN((F, S, ∅)) is consistent.Proof of Proposition 10 Let H = (Arg(T ), R) be an argumentation system such that Ext(H) =∅(under an extension-based semantics). Assume that H satisfies exhaustiveness and strict precedence. Since H satisfies strict precedence, CN((F, S, ∅)) ⊆ Output(H). S, ∅)). Thus, Seq(d) ⊆ CN((F, S, ∅)). From exhaustiveness, (d, x) ∈ E.

		⊓ ⊔
	Proof of Proposition 9 Let H = (Arg(T ), R) be an argumentation system such that
	Ext(H) =∅(under an extension-based semantics). Assume that H is closed under
	sub-arguments and satisfies exhaustiveness. Let E ∈ Ext(H). From the monotonicity of
	Arg, it holds that E ⊆ Arg(Th(E)).L e t(d, x) ∈ Arg(Th(E)). From Proposition 12,
	Seq(d) ⊆ Concs(E). From the exhaustiveness postulate, (d, x) ∈ E.	⊓ ⊔
	From Property 11,f o ra l lE ∈ Ext(H), CN((F, S, ∅)) ⊆ Concs(E).L e t(d, x) ∈
	Arg((F,

  Proof ofProposition 13 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under sub-arguments. Assume that H violates exhaustiveness. Thus, there exists E ∈ Ext n (H) and there exists a= (d, x) ∈ Arg(T ) such that Seq(d) ⊆ Concs(E) but (d, x)/ ∈ E.So, ∃b = (d ′ , x ′ ) ∈ E such that aRb or bRa.SinceR is conflict-dependent, Seq(d) ∪ Seq(d ′ )is inconsistent. Thus, ∃y ∈ Seq(d) such that ¬y ∈ d ′ .But,y, ¬y ∈ CN(Th(E)).SinceH Proof of Proposition 14 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under subarguments. From Proposition 13, H satisfies exhaustiveness. From Proposition 9, it follows that for all E ∈ Ext n (H), E = Arg(Th(E)). Let T be a theory and d = (x 1 , r 1 ),...,(x n , r n ) a consistent sequence from T .(-→ ) Assume that (d, x) is an argument from T . d = (x 1 , r 1 ),...,(x n , r n ) yields x = x n (Definition 12). Assume that d is not focused. Let d * be obtained from d by deleting all repeated pairs. Since d is not focused, d * is not minimal. Therefore, there exists (x k , r k ) in d * (hence in d) such that depriving d * from (x k , r k ) still gives a derivation of x from T .Since d * contains no repeated pair, for every

	is closed under sub-arguments, CN(Th(E)) = Concs(E). Thus, y, ¬y ∈ Concs(E).This
	contradicts the fact that H satisfies consistency.	⊓ ⊔
		⊓ ⊔
	Proof of Proposition 15 The proof is similar to that of Propositions 13 and 14.	⊓ ⊔
	Proof of Theorem 1

  By Property 2, x * h = x * i for i = h. Hence, Head(r * i ) = x * h for i = h. Seq(d ι ). Therefore, j is not the greatest index such that x * j is in Seq(d * ) but not in Seq(d ι ). Let H = (Arg(T ), R) be an argumentation system built over a theory T = (F, S, D) such that CN((F, S, ∅)) is consistent and R is conflict-dependent and privileges strict arguments. For all a ∈ Arg(Free(T )),b ∈ Arg(T ),i faRbo rb Ra, then ∃a ′ ∈ Sub(a) such that a ′ is strict and a ′ Rb.

	Together with x * j / ∈ Seq(d ι ) and x * j ∈ Body(r * h ), this entails x * h / ∈ ⊓ ⊔
	Lemma 1

* )

but not in Seq(d ι ) (clearly, j < p). Since d * is minimal, there must exist h > j such that x * j ∈ Body(r * h ) (otherwise d * deprived of (x * j , r * j ) would give a proper subsequence also being a derivation of x).

  (F, S, D) such that R is conflict-dependent. Assume that for all E ∈ Ext n (H), Arg((F, S, ∅)) ⊆ E. Assume now that ∃a ∈ Arg((F, S, ∅)) and ∃b ∈ Arg(T ) such that aRb or bRa.S i n c eR is conflict-dependent, (b, b)/ ∈ R (cf. Proposition 4). Thus,∃E ∈ Ext n (H) such that b ∈ E. Consequently, a, b ∈ E,this contradicts the fact that E is conflict-free (since it is a naive extension). Let H = (Arg(T ), R) be an argumentation system built over a theoryT = (F, S, D) such that R is conflict-dependent. Assume that ∃a, b ∈ Arg(T ) such thata ∈ Arg((F, S, ∅)) and Conc(a) =¬ Conc(b). Thus, (b, b)/ ∈ R and ∃E ∈ Ext n (H) such that b ∈ E.IfH satisfies strict precedence, then Conc(a) ∈ Concs(E) meaning that Concs(E) is inconsistent. Thus, H violates consistency. If H satisfies consistency, then Conc(a)/ ∈ Concs(E) meaning that H violates strict precedence.

	Assume now that for all a ∈ Arg((F, S, ∅)), ∄b ∈ Arg(T ) such that aRb or bRa.This
	means that arguments of Arg((F, S, ∅)) are not attacked. Thus, they belong to every naive
	extension.	⊓ ⊔
	Proof of Theorem 6

T = ⊓ ⊔

Proof of Theorem 7 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under sub-

arguments. Let E, E ′ ∈ Ext n (H) such that Concs(E ′ ) ⊆ Concs(E). Assume that ∃a = (d, x) ∈ E\E ′ . Thus, ∃b = (d ′ , x ′ ) ∈ E ′ such that aRb or bRa.SinceR is conflict-dependent, Seq(d)∪Seq(d ′ ) is inconsistent. But H is closed under sub-arguments.

Thus, Proposition 12 gives Concs(E) = CN(Th(E)) and Concs(E ′ ) = CN(Th(E ′ )). Besides, Seq(d) ⊆ CN(Th(E)) and Seq(d ′ ) ⊆ CN(Th(E ′ )) using Propositions 12 and 14. Since CN(Th(E ′ )) ⊆ CN(Th(E)), Seq(d) ∪ Seq(d ′ ) ⊆ CN(Th(E)). Thus, CN(Th(E)) is inconsistent. This contradicts the fact that H satisfies consistency. The same reasoning holds for a = (d ′ , x ′ ) ∈ E ′ \E. ⊓ ⊔ Proof of Theorem 8 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies consistency and closure under subarguments. Let E ∈ Ext n (H). From Proposition 6, CN(Th(E)) is consistent. Thus, ∃O ∈ Opt(T ) such that Th(E) ⊑ O. From Property 4, CN(Th(E)) ⊆ CN(O).S i n c eH is closed under sub-arguments, CN(Th(E)) = Concs(E) by Proposition 12. Thus, Concs(E) ⊆ CN(O). Assume now that ∃x ∈ CN(O)\Concs(E). Then, there exists a minimal derivation d for x from O.From Property 3, Seq(d) ⊆ CN(O).SinceCN(O) is consistent,

  Proof of Theorem 17 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R ∈ℜ s2 . From Corollary 5, Ext s (H) = Ext ss (H). Assume that ∃E ∈ Ext p (H)\Ext s (H). From Theorem 22, there exists O ∈ Max(POpt(T )) such that Th(E) ⊑ O.Since|Ext s (H)|=|Max(POpt(T ))|, from Theorem 16, Arg(O) ∈ Ext s (H). From Theorems 13 and 14, O = Option(Arg(O)). From Theorem 24, E = Arg(O). ⊓ ⊔ Proof of Theorem 18 Let H = (Arg(T ), R) be an argumentation system such that R ∈ℜ s 2 . If H satisfies all the postulates under naive semantics, then from Corollary 1 and Theorem 11, there is a bijection between Ext n (H) and Max(POpt(T )). From Theorems 13 and 16, |Ext s (H)|=| Max(POpt(T ))|. Since every stable extension is a naive one, Ext n (H) = Proof of Theorem 19 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R ∈ℜ s 2 . From Property 11, From Theorems 13 and 14,forallE i ∈ Ext s (H), there exists a unique O i ∈ Max(POpt(T )) such that Concs(E i ) = CN(O i ). Thus, Proof of Theorem 21 Let H be an argumentation system built over a theory T = (F, S, D) such that H satisfies the strict precedence postulate, i.e., F ⊆ Output(H).Since⊤∈F, Output(H) =∅. Hence, Ext p (H) ={∅}. ⊓ ⊔ Proof of Theorem 22 Let H = (Arg(T ), R) be an argumentation system built over a theory T such that R is conflict-dependent and H satisfies the five postulates. Let E ∈ Ext p (H) and

	Ext s (H).	⊓ ⊔
	Output(H) =	Concs(E i ).
	E i ∈Ext s (H)
	Output(H) =

O i ∈Max(Opt(T ))

CN(O i ).

⊓ ⊔

Proof of Theorem 20 Let H = (Arg(T ), R) be an argumentation system built over a theory

T such that R ∈ℜ s 3 . From Property 11, Output(H) = E i ∈Ext s (H)

Concs(E i ).

From Theorem 13,forallE i ∈ Ext s (H), there exists a unique

O i ∈ Max(POpt(T )) such that Concs(E i ) = CN(O i ).SinceR ∈ℜ s 3 , |Ext s (H)| < |Max(POpt(T ))|. Thus, Output(H) = O i ∈X CN(O i ) with X ={O i ∈ Max(POpt(T )) | E i = Arg(O i ) ∈ Ext s (H)}.

⊓ ⊔

Let T be a theory. Free(T ) is a sub-theory (X, Y, Z ) of T such that for all minimal conflictC = (X ′ , Y ′ , Z ′ ) of T , it holds that X ∩ X ′ =∅and Y ∩ Y ′ =∅and Z ∩ Z ′ =∅.Aminimal conflict of theory T is a sub-theory C of T such that CN(C) is inconsistent and ∄C ′ ⊏ C such that CN(C ′ ) is inconsistent.

⊓ ⊔ Proof of Theorem 9 Let H = (Arg(T ), R) be an argumentation system built over a theory

T such that R is conflict-dependent and H satisfies consistency and closure under subarguments.

• Let E, E ′ ∈ Ext n (H).

⊓ ⊔

Proof of Theorem 10 Let H = (Arg(T ), R) be an argumentation system built over a theory

T such that R is conflict-dependent and H satisfies consistency and closure under subarguments. Proof of Theorem 24 Let H = (Arg(T ), R) be an argumentation system built over a theory

T such that R is conflict-dependent and H satisfies exhaustiveness and closure under sub-

Th(E ′ ) ⊑ O. We show that E ∪ E ′ is a preferred extension (which contradicts the fact that E and E ′ are preferred extensions).

From Proposition 3, Arg(Th(E)) ⊆ Arg(O) and Arg(Th(E ′ )) ⊆ Arg(O).SinceH satisfies exhaustiveness and closure under sub-arguments, from Proposition 9, Arg(Th(E)) = E

and Arg(Th

Moreover, E ∪ E ′ defends its elements since E and E ′ are preferred extensions.

Thus, E ∪ E ′ is an admissible set. Due to E and E ′ being preferred extensions, it follows that

Proof of Theorem 25 Let H = (Arg(T ), R) be an argumentation system built over a theory This means that Def(d) ⊆ n i=1 D i . Consequently, d is also a derivation schema from

Thus, d is a derivation schema from each theory O i and (d, x) is an argument in each

From above, it follows that

Arg(O i ) = Arg(Free(T )).

⊓ ⊔

Proof of Theorem 28 Let H be an argumentation system which satisfies the five postulates.

From strict precedence and the fact that Output(H) = Concs(IE(H)), it holds that

Proof of Theorem 29 Let H = (Arg(T ), R) be an argumentation system built over a theory T . Assume that R ∈ℜ p 2 and privileges strict arguments. From Theorem 27, Please check and confirm the corresponding author is correctly identified.

2.

As per journal style instruction biography is must, however it is missing. Kindly provide biography.