<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Deduction through Argumentation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Emmanuelle Dietz</string-name>
          <email>emmanuelle.dietz@airbus.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Antonis Kakas</string-name>
          <email>antonis@ucy.ac.cy</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Airbus Central Research &amp; Technology</institution>
          ,
          <addr-line>Hamburg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Computer Science, University of Cyprus</institution>
          ,
          <addr-line>Nicosia</addr-line>
          ,
          <country country="CY">Cyprus</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The Cognitive Argumentation framework is based on the premise that human logical reasoning is fundamentally a process of dialectic argumentation. To achieve a human cognitive form of logical reasoning, Cognitive Argumentation incorporates, within a general and abstract framework of computational argumentation from AI, cognitive principles derived from empirical and theoretical work in Cognitive Science. Concentrating on the case of conditional reasoning, we study how the two modes of reasoning, predictive (deductive) or explanatory (abductive) as used by humans, can be uniformly captured within the Cognitive Argumentation framework. Within this unification of deductive and abductive reasoning we show how the relative weakness of abductive reasoning is reflected in argumentation by the presence of multiple explanatory arguments that conflict with one another. The approach is evaluated using Byrne's suppression task showing how the whole empirical data concerning both deductive and abductive reasoning cases by the participants is modelled well by Cognitive Argumentation.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Observing the world and from there, inferring new knowledge, is often called abduction whose conclusion
is referred to as an explanation for the observation. This differs from deduction as abduction works in
reverse, from observations to potential premises. We are interested in investigating whether humans
distinguish between these types of inferences, and if so, to understand how the difference comes about.</p>
      <p>Although deduction and abduction are formally defined as two different forms of reasoning, there are
clearly related as typically abduction is defined by appealing to deduction. We conjecture that in common
sense human reasoning they are realized in the same way in terms of reasoning via argumentation. We
thus claim that arriving at a deductive or abductive conclusion is carried out by the same process of
forming a good quality argument supporting the conclusion arrived at by either form of reasoning.</p>
      <p>This unified view of abductive reasoning with that of deductive reasoning can be achieved via the
formation of (common sense) knowledge of associations between information, called argument schemes,
generating supporting arguments in both a deductive direction but also in the reverse abductive direction.
Hence, we have knowledge of argument schemes that associate premise information from which we
would deductively arrive at a conclusion, e.g. premise information that can bring about the conclusion
of a new state of affairs, and abductive or explanatory argument schemes that associate these two same
pieces of information in the reverse order, e.g. that would associate the premise (observation) of a new
state of affairs as a premise to support the information that would bring this premise about. For example,
we would have a deductive argument scheme “birthday supports having a party” and in addition the
abductively explanatory scheme “having a party supports birthday”.</p>
      <p>Both of these types of argument schemes, deductive or abductive, are treated as defeasible by
argumentation, even the deductive one, since we can have exceptional cases, e.g. where “although it is our birthday
we do not have a party”. Yet, deduction is generally stronger than abduction and hence the weakness
of abductive reasoning over deduction should manifest itself in their argumentative formulation. This
relative weakness of abduction comes about throught the fact that typically we can have many different
Greece</p>
      <p>CEUR
explanatory abductive argument schemes based on the same premise observation and that these different
argument schemes are considered (based on the principle of Occams razor of simplicity of explanation)
as conflicting with each other, thus producing counter-arguments of each other. For example, we can have
a second explanatory scheme of “having a party supports anniversary day” and this would form a counter
argument to the earlier one of supporting “birthday” from the same premise information of observing that
we are “having a party” (and vice-versa). In contrast, although we would also have a second deductive
argument scheme of “anniversary day supports having a party” this is not considered to be in conflict
with the earlier one and hence the deductive inference that is generated from either of these two argument
schemes is not questioned by the other one.</p>
      <sec id="sec-1-1">
        <title>1.1. Related Work</title>
        <p>
          We will be validating our approach using the empirical data from the Suppression Task experiment [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
Although traditionally this experiment is seen as showcasing the non-monotonicity of human reasoning
it is also evident that its results related more generally to different aspects of human reasoning. The
experiment reports the “suppression” of inference, i.e. the comparative reduction in the percentage of
human participants reaching a definite conclusion, in both deductive and abductive mode of reasoning.
Although the experiment is old, first carried out in 1989 and repeated several times after that - e.g. in [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ],
it becomes relevant in today’s AI that has turned again to automating human cognitive reasoning. Indeed,
developments in Human-centric or Cognitive AI [
          <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
          ] have shown the importance of synthesis of AI
computational theory and models with Cognitive Science and its study of human reasoning.
        </p>
        <p>
          The "reverse link" between link between abduction and deduction is well known, starting from the
pioneering work of Peirce on abduction to many recent works such as the link of abduction to the inverse
process of completing a logic program [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. In this paper, we are further claiming that this “inverse” link
can be formalized through argumentation. For example, in inverse planning [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], together with argument
schemes capturing the standard “effect axioms” of the causal generation of effects by actions or agent
intentions, we can also have abductive explanatory argument schemes in the reverse order, supporting
the occurrence of an action based on the premise of some effects of the action or intention that would
bring about the occurrence of the action. Similarly, in a theory of mind used to understand the behaviour
of people [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ], we can have a model of argument schemes which through deduction would allow us to
predict peoples actions from their mental-states of beliefs and desires, while mental-state inference is
achieved via abduction by inverting the model.
        </p>
        <p>
          At the foundational level abduction has normally been viewed as surrogate to deductive inference,
formalized at the meta-level in terms of the underlying deductive inference of a given logical system. In
[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] this is characterized as an external approach to abduction. Our approach, like the internal approach
in [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] treats abductive reasoning at the same level as deductive reasoning. Both forms of reasoning are
captured in terms of the same process of argumentation. The internal approach of [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] unifies the abduction
and deduction within an argumentation-based sequent calculus by extending this with abductive sequents.
Therefore the same process of this extended calculus produces the two forms of reasoning. In comparison,
whereas this work is interested in the (pure) logical properties of the formulation, e.g. to connect its
internal and external approaches, our work puts the emphasis on the cognitive properties of the unification,
e.g. encompassing the Occam’s Razor feature of (typically) mutual exclusiveness of different abductive
explanations.
        </p>
        <p>
          It is also important to note that there are many formal models of human reasoning that address more
generally the way that humans arrive at conclusions and decisions. Within this terrain of work and
amongst those that are based on argumentation a notable approach is that of Bayesian Argumentation
[
          <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
          ]. Bayesian Argumentation is based on probability theory to capture arguments for the degree of
human belief in statements and conclusions drawn from them and how such beliefs are revised according
to Bayes theorem. In comparison our approach of Cognitive Argumentation is complementary to the
Bayesian approach where its probability theory gives us a level of quality of the argument schemes and
the relative strength between them that we then adopt in Cognitive Argumentation to reason with.
        </p>
        <p>
          Summarizing, in this paper we will examine and support the following hypotheses:
1. Human reasoning is driven by deductive and explanatory associations between information.
2. These associations are realized in the same way in terms of reasoning via argumentation captured
by deductive and explanatory schemes in Computational Argumentation from AI.
3. These two different but related types of associations can have distinct properties: In some cases
and often explanatory reasoning is weaker than deductive reasoning, which in Argumentation, is
captured by the existence of several ’weaker’ explanatory arguments conflicting with each other.
These hypotheses 1 to 3 will guide the structure of this paper. Section 2 will informally introduce human
conditional reasoning that motivates hypothesis 1. After that, Section 3 addresses hypothesis 2 and
shows how these associations are realized in Argumentation. In Section 4, we will illustrate the distinct
‘behavior’ of these two associations that are put forward by hypothesis 3 and validate the conjecture
of these three hypotheses by showing how a unified argumentative model of deduction and abduction
captures well the complete empirical data from the suppression task [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. Conditional Reasoning</title>
      <p>Both reasoning forms of deduction and abduction operate based on some given knowledge. We come
to deductive conclusions that follow from some prior knowledge and similarly we generate abductive
explanations of observations according to some accepted model of the world that we are observing. In
common sense human reasoning one important form of knowledge is that of conditionals. In this section,
we will consider some basic characteristics of conditionals stemming from their use in human reasoning.</p>
      <p>
        Humans make assumptions while reasoning, many of which are not necessarily valid under (formal)
classical logic. We will call such assumptions cognitive principles of Human Reasoning [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. We will
propose canonical associations for conditionals based on prediction and explanatory associations and
examine how Byrne’s [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] distinction between different types of conditions influence them.
      </p>
      <sec id="sec-2-1">
        <title>2.1. Deductive and Explanatory Schemes from Conditions</title>
        <p>Let us first review, through an example, the different forms of conditionals based either on a sufficient or
a necessary condition.</p>
        <p>Consider the sentence:</p>
        <sec id="sec-2-1-1">
          <title>If I need milk, then I will buy milk. (need ↝ buy).</title>
          <p>The condition I need milk can be understood as sufficient , in the sense that if the condition holds, then
this forms a support for the consequent, I will buy milk, to hold as well (modus ponens). On the other
hand, the negation of the condition, I don’t need milk, seems to be a plausible support for the negation of
the consequent, I will not buy milk (denying the antecedent). Thus the condition can also be understood
as necessary for the consequence to hold.</p>
        </sec>
        <sec id="sec-2-1-2">
          <title>Now consider also: If my mother asks me to get her milk, then I will buy milk.</title>
          <p>(asks ↝ buy)
Both conditions in (need ↝ buy) and (asks ↝ buy) are separately sufficient for the consequence to
hold. However, now the negation of either of these conditions alone is not enough to conclude the
negation of the consequence, I will not buy milk. Only the negation of both conditions together, gives
sufficient support to conclude the negation of the consequence. Therefore, individually the conditions in
(need ↝ buy) and (asks ↝ buy) are not necessary conditions. Now that there is a second way to bring
about the consequent, the condition I need milk has lost its (poosibly) necessary property.</p>
          <p>Let us assume that, in addition to (need ↝ buy) and (asks ↝ buy), we are given the following
conditional: If I have enough money, then I will buy milk. (money ↝ buy) By (money ↝ buy) we
are made aware of the possibility that even in the case where, I need milk or my mother asks me to get her
milk, I might not buy milk, because possibly I don’t have enough money. Having enough money is a clear
necessary condition for the consequent: without it the consequent cannot hold, i.e. I cannot buy milk, no
matter what other (sufficient) conditions might hold at the time. Also in comparison with the the above
cases we might consider this a strong necessary condition in the sense that it is very unlikely for this to
loose its necessary property. On the other hand, the condition of (money ↝ buy) cannot be considered as
a sufficient condition: even if I have enough money, I might not buy milk.</p>
          <p>The distinction between the two different types of conditions, sufficient and necessary, is significant
when we consider explanations of the consequent and its negation. Assume that we are given the
information that I did not buy milk. (buy) It is reasonable that, given (need ↝ buy) and (asks ↝ buy)
(without (money ↝ buy)), to conclude the negation of the condition of both conditionals, namely that I
did not need milk and my mother did not ask me to get her milk. Adding the conditional (money ↝ buy)
in the context of reasoning does not extend this conjunction but results in a disjunctive addition of the
negation of the new (necessary) condition: Either (I do not need milk and my mother does not ask me to
get her milk) or (I do not have enough money). Hence the observation of the negation of the consequent
can be explained by the negation of a necessary condition (e.g. I do not have enough money) or by
assuming that there is “no reason” for the consequent to hold, resulting in a more complex explanation,
namely that none of the sufficient conditions can hold.</p>
          <p>In contrast, if we are given the positive information that a consequent holds, e.g. I buy milk, then this
can be simply explained by any one of the sufficient conditions for the consequent, e.g. either by I need
milk or by my mother asks me to get her milk. It is important to note that typically we will not consider
that two such sufficient conditions, together, form an explanation. In fact, we typically consider that
different explanations are incompatible with each other, except perhaps in very exceptional cases where
many different reasons can hold together. Hence we will only accept one, either I need milk or my mother
asks me to get her milk to explain the consequent I buy milk but not both together. Similarly, when we
are explaining the negation of the consequent, e.g. I did not buy milk, we will only accept one of the
explanations, either I do not have enough money or there is “no reason”, i.e. I did not need milk and my
mother did not ask me to get her milk.</p>
          <p>
            Hence different explanations are in general considered to be in tension with each other. They are
competing or contrasting alternatives as implied for example by the maxim of “Inference to the best
explanation” (see e.g. [
            <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
            ]). The process of explanation is not merely to find why something
holds but also why this is indeed the reason for holding and not for some other reason. In [
            <xref ref-type="bibr" rid="ref15 ref16">15, 16</xref>
            ] a
cognitive principle of explanatory discounting is identified which assumes that alternative explanations
are in conflict with each other so that support for one explanation results in diminishing support, thus
counter-support, against alternative explanations.
          </p>
          <p>We note that depending on the nature of the condition, sufficient or necessary, we can draw further
conclusions in, what we will call, a secondary mode of predictive or explanatory reasoning. Observing
the negation of the consequent can lead us to the prediction of the negation of any of its sufficient
conditions. We refer to this as secondary since the conditional is not used in its canonical form of “if ...
then ...” but in a transformed form of the contra-positive.</p>
          <p>
            Finally, we note that a necessary condition cannot be considered as a possible explanation for the
consequent holding. Prediction of several necessary conditions from the same consequent, as opposed to
different explanations, do not compete with each other [
            <xref ref-type="bibr" rid="ref17">17</xref>
            ] and hence they can hold together when we
are given that the consequent holds. They always hold and hence they do not offer any discriminatory
information between alternatives as we would require from explanations.
          </p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Canonical Associations of Condition and Consequence</title>
        <p>Based on the above analysis, Table 1 summarizes the canonical associations of different types of conditions
with a consequent under prediction and abduction or explanation. These associations will correspond to
argument schemes that will form the basis for the argumentative reasoning that we will consider for the
unification of deduction and abduction. We establish the following rule associations 1 between a condition
and a consequent. These are read from the table by associating the given fact labeling any of the last 4
columns with the statement appearing below in the column.</p>
        <p>1Associations are written with ↝ instead of → to emphasize their defeasible nature.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Cognitive Argumentation</title>
      <p>
        The framework of Cognitive Argumentation (CA) is built by synthesizing cognitive principles from
Cognitive Science and Philosophy within the framework of computational argumentation in AI, [
        <xref ref-type="bibr" rid="ref18 ref19 ref20">18, 19,
20</xref>
        ]. The task is to understand the cognitive principles into a concrete computational form so that they can
be reflected in computational argumentation. We review the basic components of the formal framework
of CA. Details are found in [
        <xref ref-type="bibr" rid="ref11 ref21">21, 11</xref>
        ].
      </p>
      <sec id="sec-3-1">
        <title>3.1. Argumentation Theory</title>
        <p>
          An argumentation theory or model within CA consists of a triple  ℒ = ⟨ ,  , ≻⟩ where   is a set
of argument schemes,  is a conflict relation in the language of the framework and ≻ is a binary strength
relation on   . Argument schemes were introduced as stereotypical reasoning patterns that are typically
non-deductive [
          <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
          ]. Formally, an argument scheme, as ∈   , is a tuple of the form as = (pre, pos)
where the premises pre and position pos are (sets of) statements in the language of discourse ℒ. Using an
argument scheme as = (pre, pos) we can construct an individual argument that supports the position pos
based on the premises pre. An argument Δ, is then a set of individual arguments that are grouped together
as a coalition to support a position (e.g. a conclusion) we are interested in. The conflict relation 
in  ℒ = ⟨ ,  , ≻⟩ specifies when arguments conflict with each other and is used to give the notion of
attack between two arguments. Δ′ attacks or is a counterargument of Δ, iff together these arguments
have a conflict under  , e.g. when Δ supports  and Δ′ supports  , the negation or complement of  .
The strength relation ≻ in  ℒ = ⟨ ,  , ≻⟩ captures the relative strength among arguments. Given
two argument schemes as and as′, as ≻ as′ means that arguments constructed from as are stronger
than arguments constructed from as′. This gives a notion of defense between conflicting arguments.
Informally, argument Δ defends against Δ′ only when its arguments are at least as strong as those of Δ′.
        </p>
        <p>Reasoning via argumentation is normally based on a normative criterion of acceptability of arguments.
We will consider a particular notion of acceptability, called admissibility. Formally, an argument Δ is
admissible in  ℒ( ) iff Δ is conflict-free (under  ) and Δ defends against all its counter-arguments
attacking Δ. Hence an admissible set of arguments is a coalition in which there exists arguments which
are strong enough to counter-attack, i.e. defend against, any argument that attacks it.</p>
        <p>
          We can then define what is a conclusion of argumentative reasoning as follows. We say that a
statement  is an acceptable or a credulous conclusion of a given argumentation framework  ℒ, iff
there exists an admissible argument Δ in  ℒ that supports  .  is a skeptical conclusion of  ℒ iff  is a
credulous conclusion of  ℒ, and  is not a credulous conclusion of  ℒ( ) , i.e. there is no admissible
argument supporting  . Credulous and skeptical conclusions represent plausible and definite conclusions,
respectively. Given the semantic definition of a plausible conclusion, the actual reasoning process to
ifnd such conclusions follows a natural dialectic argumentation process. This consist of the following
basic steps (see e.g. [
          <xref ref-type="bibr" rid="ref24 ref25">24, 25</xref>
          ] for technical details): (step 1) Construct a root argument supporting a
conclusion of interest, (step 2) consider a counterargument against the root argument, (step 3) find a
defense argument against the counterargument, (step 4) check that this defense argument is not in conflict
with the root argument, (step 5) add this defense argument to the root argument, and repeat from (step 2),
i.e. consider another counterargument to the now extended root argument.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Conditional Reasoning in Cognitive Argumentation</title>
        <p>In order to apply the argumentative reasoning to model human reasoning we also need a second orthogonal
condition of the arguments involved, namely that these are grounded on the perceived (current) state of
the environment. Human reasoning is carried out under a current state of information that the environment
gives or makes us aware of. This information can be captured by a cognitive state  = (ℱ ,  ) where
ℱ is a set of facts provided by the environment and  is an awareness set of propositions which the
environment has awaken as relevant in the current reasoning. The first element consists of explicit factual
information that the environment provides to the reasoner while the second consists of the propositions
that the reasoner is made aware of by the current environment. We can assume, ℱ ⊆  . An admissible
argument Δ is then also required to be grounded on the current cognitive state, i.e. that all arguments
in Δ need to eventually be based on information that refers to the cognitive state. Reasoning under
argumentation is then carried out by considering grounded and admissible arguments that support a
concluding statement.</p>
        <p>To ground the reasoning we can introduce two new argument schemes in   . The fact scheme:
fact() = (∅, ) ∈   , applied for any statement  ∈ ℱ of the current cognitive state  = (ℱ ,  ) .
Similarly, we have a hypothesis scheme: hyp() = (∅, ) ∈   and hyp() = (∅, ) ∈   , for any
proposition,  , in  . The conflict relation  is then also extended by: (1) hypotheses schemes are weaker
than any other opposing scheme and (2) fact schemes are stronger than any other opposing scheme.</p>
        <p>The dialectic argumentation process for constructing admissible arguments can be given a tree structure
and illustrated as such by figures of growing trees of attacking and defending arguments. For the above
example this is shown on the left of Figure 1. In these dialectic reasoning figures, (temporarily) admissible
arguments are highlighted in gray and non-admissible arguments are in white. ↑ shows attacks between
arguments, i.e. arguments that are in conflict. ⇑ shows strong defenses, i.e. attacks that cannot be defended
against by the argument they are defending against. In many cases these strong defenses determine the
(final) acceptability of arguments.</p>
        <p>Let us now analyse an example of the dialectic argumentative reasoning process for conditional
reasoning as illustrate in Figure 1. Assume that in the milk example of the previous section the cognitive
cognitive state is  ′ = ({need}, {need, asks, buy, money}). The position of interest is buy. In Step 1 we
construct a root argument,</p>
        <p>Δnneeeedd↝buy = {fact(need), suf_p (need ↝ buy)}, supporting buy
.</p>
        <p>In Step 2, we check whether there are counterarguments against this argument. We can construct the
following counterargument: Δmoney↝n buy = {hyp(money), necc_p(money ↝ buy)},
which is grounded in  ′, because money ∈  ′. Can we find ( Step 3) a defense against Δmoney↝n buy ?
Note that Δnneeeedd↝buy cannot itself defend against Δmoney↝n buy , because necc_p(money ↝ buy) is
stronger than suf_p (need ↝ buy). Nevertheless, a defense is given by the hypothesis argument
hyp(money) = (∅, money), which we can add (Step 4 and Step 5) to Δnneeeedd↝buy .</p>
        <p>This new extended argument is denoted as Δnneeeedd↝buy, . Returning to Step 2 we look for other
Δmmoonneeyy↝buy = {fact(money), necc_p(money ↝ buy)}.
counterarguments. Such a counterargument is given by the hypothesis argument, hyp(buy) = (∅, buy),
need
which is trivially defended against with the root argument, Δneed↝buy . In other words, there is no need to
ifnd a different defense argument and extend further the current root argument in Step 1.</p>
        <p>On the right of Figure 1 the same process for the non-admissibility of Δnneeeedd↝buy is shown when the
cognitive state contains as a fact money. It shows that there is no defense against the strong attack of</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Deduction and Abduction in the Suppression Task</title>
      <p>
        We will now apply the argumentation framework, developed in the previous section, to the well-known
study of human conditional reasoning called the suppression task [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. We will see how within the same
argumentation framework containing predictive and explanatory argument schemes we can model well
the whole empirical data, whether these are cases of deductive or abductive reasoning.
      </p>
      <p>The experimental setting of the suppression task was as follows. Three groups of participants were
asked to derive conclusions given variations of a set of conditionals (and factual information). Group I
Δnneeeedd↝buy
Δnneeeedd↝buy
Δnneeeedd↝buy
Δnneeeedd↝buy
Δnneeeedd↝buy
Δmoney↝n buy
Δmoney↝n buy
{hyp(money)}
Δnneeeedd↝buy∪
{hyp(money)}
{hyp(buy)}
Δnneeeedd↝buy
Step (1)</p>
      <p>Step (2)</p>
      <p>Step (3, 4) 5, repeat Step (2)</p>
      <p>Step (1)</p>
      <p>Step (2)
was given the following conditional knowledge:2</p>
      <sec id="sec-4-1">
        <title>If she has an essay to finish, then she will study late in the library.</title>
        <p>In addition to the above conditional for Group I, Group II was given the following conditional:</p>
      </sec>
      <sec id="sec-4-2">
        <title>If she has a textbook to read, then she will study late in the library.</title>
        <p>Group III received, together with the conditional of Group I, additionally the following conditional:</p>
      </sec>
      <sec id="sec-4-3">
        <title>If the library stays open, then she will study late in the library.</title>
        <p>For each group, four different cases of reasoning were considered by combining their conditional
knowledge with one of the following factual information: She has an essay to finish ( ), She will study
late in the library (ℓ), She does not have an essay to finish ( ) or She will not study late in the library ℓ.</p>
        <p>The participants were asked what necessarily had to follow in each case based on their conditional
knowledge and the fact of the case. For each case of a given factual information they were asked if some
other statement followed. For example, in the first case where the factual information is “She has an essay
to finish” they were asked whether “She will study late in the library”. They would answer by choosing
one of following: She will study late in the library, She will not study late in the library or She may or
may not study late in the library.</p>
        <p>
          The study in [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] then reported the experimental results for twelve cases as summarized in Table 3. This
table shows for each group (column 1), the conditional information they received (column 2) together
with the factual information for each of the four cases (column 3 to 6). In each row we can see the
percentage of responses by the participants in the group corresponding to the row of the table. Those in
gray are the responses demonstrating the suppression effect, namely when in Groups II or III we observe
a significant reduction of the percentage of the participants choosing the same majority answer as in
Group I. For example, the majority’s responses in Group II diverges in two cases from the majority’s
2The participants received the natural language sentences but not the abbreviated notation on the right hand side.
1–14
Δmmoonneeyy↝buy
( ↝ ℓ)
( ↝ ℓ)
( ↝ ℓ)
suficient prediction/ suf_p  ↝ ℓ
necessary prediction/ necc_p ( ↝ ℓ)
secondary necessary prediction/ sec_necc_p (ℓ ↝  )
secondary suficient prediction / sec_suf_p ℓ ↝ 
suficient explanation / suf_e ℓ ↝ 
necessary explanation/ necc_e (ℓ ↝  )
secondary suficient explanation / sec_suf_e ℓ ↝ 
exogenous explanation/ exo_e
Group II
responses in Group I: When participants received the information, that She does not have an essay to
ifnish ( ), only 4% concluded that She will not study late in the library (ℓ), and when they received the
information that She will study late in the library, only 13% concluded that She has an essay to finish .
        </p>
        <p>From this table we can also see the connection of the study to deduction and abduction. We can see
that the first and third cases, whose factual information is  or  , are cases of deductive reasoning where
participants would reason to see if they can derive that “Library” holds on not. On the other hand, the
second and fourth cases, whose factual information is ℓ or ℓ, are cases of abductive reasoning where
participants would try to explain the given factual information or more specifically to examine if “having
an essay to finish” or not, forms an explanation for the given factual information.</p>
        <p>The task is then to apply the framework of Cognitive Argumentation for human reasoning to show how
this can uniformly capture the experimental results in all twelve cases, accounting for the suppression
effect as well as the variation of responses within each group. By doing so we would have captured both
forms of deductive and abductive human reasoning via argumentation.</p>
        <sec id="sec-4-3-1">
          <title>4.1. Cognitive Adequacy of CA in the Suppression Task</title>
          <p>To model the human reasoning in the suppression task within the CA framework we will assume that
each participant reasons with an argumentation theory that contains a subset of conditional argument
schemes presented in Sections 2 and 3. This subset of “conditional argument schemes” differs between
the different groups reflecting the different conditionals knowledge given to each group.</p>
          <p>Table 4 shows the subset of these arguments for each of the three groups. The table also shows how
this subset of argument schemes may differ amongst humans depending on their understanding of a
condition as sufficient, necessary or both. For Group I and III the condition She has an essay to finish
can be interpreted both as sufficient and necessary. For some part of the population this may only be a
sufficient condition in which case the associations shown in parentheses in the columns for Groups I and
III will not apply. In Group II, She has an essay to finish is no longer considered as necessary due to
the presence of a second sufficient condition of She has a textbook to read. They are both considered in
the whole population of Group II only as sufficient conditions. Table 5 shows, following Table 2 on the
incompatibility of explanations, the conflict relation between the various explanatory argument schemes
in the Suppression Task argumentation theory. Note, for example, in the first row that the two explanatory
schemes based on the observation of  are incompatible despite the fact that a student would typically
have both the tasks of writing an essay or reading a text book. The incompatibility of the explanatory
schemes though does not concern what would hold in general, but rather it says that for any particular
case of going to the library there is typically only one reason for this.</p>
          <p>In the suppression task experiments, participants are asked to select between three alternatives about a
(natural language) statement  : (i)  holds, (ii)  does not hold and (iii)  may or  may not hold. We can
see that the first two options refer to a definite conclusion for or against  , while the third option refers
to a plausible conclusion about  or its complement. It is thus important to note that the experimental
conditions encourage the participants to think and reason both about definite and plausible conclusions.
Given that Cognitive Argumentation contains both forms of definite and plausible conclusions, this allows
us to set up a criterion of evaluation of the cognitive adequacy. This criterion will be based on comparing
the percentage of the participants’ responses for a position (e.g. for She will study late in the library (ℓ))
with the existence of admissible arguments for the position and/or its complement. In particular, we will
examine if in each case of the experiment: (i) there is an admissible argument for the position asked but
not for its complement (i.e. we have a skeptical definite conclusion), or whether (ii) there is an admissible
argument for that position and for its complement (i.e. we have a credulous plausible conclusion).</p>
          <p>This distinction will then be required to qualitatively correspond to variations in the observed percentage
of answers within the population across the three groups but also the variation within each group as
follows: (i) if the population agrees on a position overwhelmingly, then the position asked should follow
in a skeptical, definite way. On the other hand, (ii) if there is no overwhelming majority then there should
exist admissible arguments for both the position and its negation, i.e. they both should follow credulously
as plausible conclusions.</p>
        </sec>
        <sec id="sec-4-3-2">
          <title>4.2. Deductive and Abductive Reasoning in the Suppression Task</title>
          <p>We will now examine in each of the four cases of the suppression task experiment how we can capture,
within the framework of cognitive argumentation, the reported experimental results. The cognitive state
of the participants in different groups has the same factual information in anyone of the four cases, but
differs in the awareness part. For example, in the first case, participants in Group I, are assumed to be
only aware of  and ℓ. Thus, their cognitive state is  1 = ({}, {, ℓ}) . For Group II the cognitive state is
 2 = ({}, {, , ℓ}) whereas for Group III it is  3 = ({}, {, ℓ, }) . Note that the factual information is the
same for each group across all cases.</p>
          <p>In each of the four cases we will introduce the main arguments that can be constructed for and
against the property that is asked and show which ones are admissible by analyzing the relevant dialectic
argumentation processes. These will be illustrated by figures that show how the various arguments attack
and defend each other, as introduced in Section 3.
4.2.1. She has an essay to finish
In the first case all three groups were given the factual information, She has an essay to finish ( ), and
were asked whether She will study late in the library (ℓ). Figure 2 gives step-by-step the dialectic
construction of the main (i.e. stronger and more cognitively plausible) arguments for ℓ and ℓ in Group I
(left, middle left) and Group III (middle right, right). The (strongest) argument supporting ℓ is given
by combining the fact scheme for  together with the sufficient prediction scheme for ℓ (Figure 2, left):
Δe↝s ℓ = {fact(e), suf_p ( ↝ ℓ)}. It is easy to recognize this as a modus ponens reasoning form
expressed here in an argumentation perspective. For supporting ℓ the main argument is constructed by
applying the necessary prediction scheme for ℓ with the hypothesis scheme for  (Figure 2, middle left):
e
Δ ↝s ℓ</p>
          <p>e
Δ ↝s ℓ</p>
          <p>e
Δ ↝s ℓ
Δ,  ↝n ℓ Δ,  ↝n ℓ</p>
          <p>e
Δ ↝s ℓ</p>
          <p>e
Δ ↝s ℓ</p>
          <p>e
Δ ↝s ℓ
Δe↝s ℓ ∪ Δ
Δ,  ↝n ℓ Δ,  ↝n ℓ Δ,  ↝n ℓ
Δ,  ↝n ℓ Δ,  ↝n ℓ</p>
          <p>Δ

Δ
Δ,  ↝n ℓ Δ,  ↝n ℓ
Δ

Δ</p>
          <p>Δ</p>
          <p>e
Δ ↝s ℓ</p>
          <p>e
Δ ↝s ℓ
Δ,  ↝n ℓ
Δ,  ↝n ℓ = {hyp(), necc_p( ↝ ℓ)}.
individual argument: the first argument set contains the factual argument for  which is stronger than the
hypothesis argument for the opposite in the second argument, whereas the second argument set contains
a necessary argument scheme which is stronger than the sufficiency argument contained in the first</p>
          <p>These two arguments attack each other. Each set contains a stronger
argument set. But as the figures show only
It does this via the argument Δ = {fact(e)} that it contains. In fact, Δ,  ↝n ℓ is immediately defeated by the
stronger argument Δ which attacks Δ,  ↝n ℓ on the hypothesis part it contains and for which there is no
defense. Consequently, ℓ is an acceptable (plausible) conclusion whereas ℓ is not. Combining the two
results for ℓ and ℓ we see that ℓ is a skeptical conclusion: the modus ponens argument of Δe s
prevails.</p>
          <p>This conforms with our criterion of evaluation, to reflect with a skeptical conclusion the overwhelming
 ↝ℓ
majority of responses for She will study late in the library in Group I (96%).</p>
          <p>For Group II, the argumentation analysis is essentially the same as for Group I. The new awareness of
She has a textbook to read ( ) does not have a significant effect. In particular, it does not introduce any
new arguments supporting ℓ and hence ℓ remains a skeptical conclusion, as required by the overwhelming
e
Δ ↝s ℓ is able to defend against the attack by the other argument.
majority (96%) also in Group II.
argument.</p>
          <p>For Group III, differently from Group I and Group II, we can now construct another strong argument
for ℓ based on the hypothesis prediction scheme for  together with the necessary prediction scheme for ℓ
(Figure 2, right):</p>
          <p>Δ,  ↝n ℓ = {hyp(), necc_p( ↝ ℓ)}.</p>
          <p>In Figure 2 (middle right) we see how Δ,  ↝n ℓ attacks the modus ponens argument Δe s . This in turn
 ↝ℓ
inside Δ,  ↝n ℓ. Thus Δ s
is able to defend against Δ,  ↝n ℓ
e
 ↝ℓ</p>
          <p>with the help of Δ = {hyp()} by opposing the hypothesis part hyp()
∪ Δ can defend against all its attacks and so it is an admissible argument
for ℓ. Figure 2 (right) shows how Δ,  ↝n ℓ supporting ℓ can itself defend against its attack by Δ s , as
 ↝ℓ
necc_p( ↝ ℓ) in Δ,  ↝n ℓ is stronger than suf_p ( ↝ ℓ) in Δe s . Hence Δ,  ↝n ℓ is also an admissible
 ↝ℓ</p>
          <p>Summing up, we see that in Group III both ℓ and ℓ, are plausible (credulous) conclusions. This then
accounts for the observed suppression effect, as here only 38% concluded that She will study late in the
library. It is likely, that these participants constructed only the argument Δe s for ℓ and hence concluded
definitely ℓ. It seems likely that the other 62% of the participants were able to construct both Δ s and
 ↝ℓ
e
e
 ↝ℓ
Δ,  ↝n ℓ and hence were not (skeptically) sure that ℓ held.</p>
        </sec>
        <sec id="sec-4-3-3">
          <title>4.3. She does not have an essay to finish</title>
          <p>
            ↝ℓ
We will only briefly describe this second case referring the reader to [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ] for details.The given fact is She
does not have an essay to finish (e). Participants were asked whether She will study late in the library (ℓ).
For groups I and III about half of the participants give the definite answer of “No”. To account for this we
can separate the participants in two subgroups, those who understand  as sufficient and necessary for ℓ
and those who under it only as a sufficient condition. For the first subgroup we have a strong argument
supporting ℓ given by Δe n = {fact(), necc_p( ↝ ℓ)}.
          </p>
          <p>This argument attacks any possible argument
for ℓ and cannot be defended against in any way. Hence ℓ is a skeptical definite conclusion that would
lead to the definite answer of “No”. For the other subgroup we cannot construct this strong argument for
ℓ as we do not have the necc_p( ↝ ℓ) scheme. This makes it possible to construct admissible arguments
for either ℓ or ℓ and hence ℓ is not a skeptical definite conclusion for these participants, thus not choosing
ℓ
Δℓ↝s</p>
          <p>ℓ
Δℓ↝s 
ℓ
Δℓ↝s exo</p>
          <p>ℓ
Δℓ↝s 
ℓ
Δℓ↝s exo</p>
          <p>ℓ
Δℓ↝s 
Δ

Δ</p>
          <p>ℓ
Δℓ↝s 
Δ</p>
          <p>ℓ
Δℓ↝s</p>
          <p>ℓ
Δℓ↝s t
participants are additionally made aware of She might (not) have a textbook to read, where She has
a textbook to read ( ) is a sufficient condition for ℓ. This also means that  cannot be understood as a
necessary condition for ℓ anymore. As a result, with the absence of necc_p( ↝ ℓ) we cannot construct a
strong argument for ℓ. Consequently, the majority is more likely to construct, in the way we saw above
for Groups I and III, admissible arguments for either conclusion, ℓ and ℓ, and thus both follow credulously
with no definite answer to choose.</p>
        </sec>
        <sec id="sec-4-3-4">
          <title>4.4. She will study late in the library</title>
          <p>In this third case, all groups were asked whether She has an essay to finish
(e), given the factual
information that She will study late in the library (ℓ). The reasoning therefore of the participants is closer
to explanatory rather than predictive. We will see that we can model this reasoning with the same process
of argumentative reasoning where now the arguments that we consider come from explanatory argument
schemes for for e and e rather than predictive schemes, as in the previous cases, for ℓ or ℓ.</p>
          <p>We will assume that a significant amount of participants entered into an explanatory mode (or diagnostic
mode). In this mode these participants tried to explain the factual observation in the context of the
information that they are given in each group. Indeed, the form of the conditional information used
encourages the process of explanation when participants are given information about the consequent of
the conditionals. Nevertheless, it is important to note that reasoning to e (or e) can also be carried out
assuming that the participants interpret the condition e as necessary (in addition to sufficient) without any
reference to explanatory reasoning. The exposition of this is beyond the scope of this paper3 where the
aim is to show the sufficiency of our approach not its necessity.</p>
          <p>Figure 3 (left) shows the reasoning in any groups that renders admissible the following explanatory
ℓ
Δℓ↝s  = {fact(ℓ), suf_e (ℓ ↝ )} .</p>
          <p>This argument can only be attacked
argument supporting  :
by</p>
          <p>ℓ
Δℓ↝s exo
= {fact(ℓ), exo_e(ℓ ↝ exo())} ,
an argument for an alternative (unknown) explanation
ℓ
constructed via the explanation scheme, exo_e() = (ℓ, exo()) . Δℓ↝s  though is strong enough to defend
against this attack and thus Δℓℓ↝s  is admissible. Furthermore, strong admissible arguments for  can only
ℓ
be defended against the attack by Δℓ↝s  if they contain the alternative explanation argument exo_e(ℓ ↝
exo()) . Thus for the majority of participants who did not consider this possibility of some other unknown
reason for going to the library they would arrive at the definite answer of “yes” for  . This conforms well
with the empirical data for Groups I and II.</p>
          <p>
            Lets us now consider Group II, where a suppression effect is observed. In this group for most
participants the possibility of an alternative explanation, such as exo() , for the observed fact is made
explicit by the explanatory scheme, suf_e (ℓ ↝ ) = (ℓ, ) , which they have in their knowledge. Hence
we can construct a new argument supporting  :
ℓ
Δℓ↝s t = {fact(ℓ), suf_e (ℓ ↝ )} ,
which conflicts
with the argument Δℓℓ↝s  above for  . They attack each other and are strong enough to defend against
each other. Hence as shown in Figure 3 (right), Δℓℓ↝s t can help as a defense to construct an admissible
3The interested reader can find the full details of this and its comparison with the explanatory reasoning in [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ].
argument supporting  . We therefore now have admissible arguments for both  and  . Accordingly, e and
e are credulous conclusions for most participants, which reflects well the suppression effect in the second
group, as there was no majority (only 13%), that concluded that She has an essay to finish .
          </p>
        </sec>
        <sec id="sec-4-3-5">
          <title>4.5. She will not study late in the library</title>
          <p>
            As in the second case, we will only present a high-level description of the reasoning for the last case,
referring the reader to [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ] for details. In this case, all groups were asked whether She has an essay to
ifnish (e), given the fact that She will not study late in the library (ℓ). We will assume again that it is
natural for some participants to reason in explanatory mode as the factual information given to them
concerns the consequent of the conditional(s) in the general information and the context of reasoning.
          </p>
          <p>In an explanatory mode of reasoning in any one of the three groups we can use, together with the given
factual information of ℓ, either the explanatory argument scheme, necc_e(ℓ ↝ ) , or sec_suff_e(ℓ ↝ ) ,
to construct arguments that support  . Which one we use will depends on whether  is also understood as
a necessary condition for ℓ or not. Both of these are strong arguments and hence admissible. On the other
hand, arguments supporting  can only be defended if the reasoner has another explanation for ℓ. This
could be an explanation from an unknown reason using the exogenous explanatory argument scheme.</p>
          <p>Differently from groups I and II, participants in Group III have a concrete alternative explanation for
the given observation, namely that the reason for She will not study late in the library is that library might
not be open. This allows us to construct the argument Δℓℓ↝n  = {fact(ℓ), necc_e(ℓ ↝ )} .
As necc_e(ℓ ↝ ) is incompatible with the explanatory schemes supporting  , this new argument is able
to defend against the above arguments for  . Hence we can construct a new and admissible argument
supporting  with the help of this new argument, Δℓ n , as a defending ally against the attacks from the
ℓ↝
arguments supporting  . Hence we have admissible arguments for both  and  and so  is a non-definite
conclusion. In other words, the suppression effect can be accounted for simply by assuming that a higher
proportion of the participants (in comparison with Groups I and II) thought of an alternative explanation,
now that they are made explicitly aware of the possible explanation of the library not being open.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>We have seen how human conditional reasoning can be formulated within a framework of dialectic
argumentation, called Cognitive Argumentation, where reasoning to conclusions is understood as a
process of contemplating between alternatives and the arguments that support them. This framework of
Cognitive Argumentation offers a way to unify deductive and abductive reasoning. We have validated
this result on Byrne’s suppression task. Observed suppression coincides with the loss, in the suppression
group, of skeptical argumentative conclusions drawn in the other two groups. In the suppression group
admissible arguments exist that support both the conclusion and its complement. It is therefore more
likely for participants in the suppression group to consider the conclusion only plausible and hence avoid
choosing the conclusion in their answer.</p>
      <p>
        These results stem from two important properties of Cognitive Argumentation: (i) its natural distinction
between definite and plausible conclusions via the formal notions of skeptical and credulous conclusions,
(ii) its property to adapt to new and different forms of information resulting in a a context-sensitive form
of reasoning. The results of this paper come to add to earlier studies of Cognitive Argumentation [
        <xref ref-type="bibr" rid="ref21 ref26">21, 26</xref>
        ]
and lend further support to the cognitive adequacy of Cognitive Argumentation.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>R. M. J.</given-names>
            <surname>Byrne</surname>
          </string-name>
          ,
          <article-title>Suppressing valid inferences with conditionals</article-title>
          ,
          <source>Journal of Memory and Language</source>
          <volume>31</volume>
          (
          <year>1989</year>
          )
          <fpage>61</fpage>
          -
          <lpage>83</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>K.</given-names>
            <surname>Dieussaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Schaeken</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Schroyens</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>D'Ydewalle, Strategies during complex conditional inferences</article-title>
          ,
          <source>Thinking &amp; Reasoning</source>
          <volume>6</volume>
          (
          <year>2000</year>
          )
          <fpage>125</fpage>
          -
          <lpage>160</lpage>
          . doi:
          <volume>10</volume>
          .1080/135467800402820.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Lieto</surname>
          </string-name>
          ,
          <source>Cognitive Design for Artificial Minds, Routledge</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E.</given-names>
            <surname>Dietz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Kakas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Michael</surname>
          </string-name>
          ,
          <article-title>Argumentation: A calculus for human-centric AI, Frontiers Artif</article-title>
          .
          <source>Intell</source>
          .
          <volume>5</volume>
          (
          <year>2022</year>
          ). doi:
          <volume>10</volume>
          .3389/frai.
          <year>2022</year>
          .
          <volume>955579</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L.</given-names>
            <surname>Console</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. T.</given-names>
            <surname>Dupre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Torasso</surname>
          </string-name>
          ,
          <article-title>On the relationship between abduction and deduction</article-title>
          ,
          <source>Journal of Logic and Computation</source>
          <volume>1</volume>
          (
          <year>1991</year>
          )
          <fpage>661</fpage>
          -
          <lpage>690</lpage>
          . doi:
          <volume>10</volume>
          .1093/logcom/1.5.661.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C. L.</given-names>
            <surname>Baker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Saxe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. B.</given-names>
            <surname>Tenenbaum</surname>
          </string-name>
          ,
          <article-title>Action understanding as inverse planning</article-title>
          ,
          <source>Cognition</source>
          <volume>113</volume>
          (
          <year>2009</year>
          )
          <fpage>329</fpage>
          -
          <lpage>349</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.cognition.
          <year>2009</year>
          .
          <volume>07</volume>
          .005.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Shum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kleiman-Weiner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Littman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. B.</given-names>
            <surname>Tenenbaum</surname>
          </string-name>
          ,
          <article-title>Theory of minds: Understanding behavior in groups through inverse planning</article-title>
          ,
          <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
          <volume>33</volume>
          (
          <year>2019</year>
          )
          <fpage>6163</fpage>
          -
          <lpage>6170</lpage>
          . URL: https://ojs.aaai.org/index.php/AAAI/article/view/ 4574. doi:
          <volume>10</volume>
          .1609/aaai.v33i01.
          <fpage>33016163</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>O.</given-names>
            <surname>Arieli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Borg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hesse</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Straßer</surname>
          </string-name>
          ,
          <article-title>Explainable logic-based argumentation</article-title>
          , in: F.
          <string-name>
            <surname>Toni</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Polberg</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Booth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Caminada</surname>
          </string-name>
          , H. Kido (Eds.),
          <source>Computational Models of Argument - Proceedings of COMMA</source>
          <year>2022</year>
          , Cardiff, Wales, UK,
          <fpage>14</fpage>
          -16
          <source>September</source>
          <year>2022</year>
          , volume
          <volume>353</volume>
          <source>of Frontiers in Artificial Intelligence and Applications</source>
          , IOS Press,
          <year>2022</year>
          , pp.
          <fpage>32</fpage>
          -
          <lpage>43</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>F.</given-names>
            <surname>Zenker</surname>
          </string-name>
          (Ed.),
          <source>Bayesian Argumentation: The Practical Side of Probability, Synthese Library</source>
          , Springer,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Oaksford</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Chater</surname>
          </string-name>
          , Probabilities and Pragmatics in Conditional Inference: Suppression and
          <string-name>
            <given-names>Order</given-names>
            <surname>Effects</surname>
          </string-name>
          , John Wiley Sons, Ltd,
          <year>2003</year>
          , pp.
          <fpage>95</fpage>
          -
          <lpage>122</lpage>
          . URL: https://onlinelibrary. wiley.com/doi/abs/10.1002/047001332X.ch6. doi:https://doi.org/10.1002/047001332X.ch6. arXiv:https://onlinelibrary.wiley.com/doi/pdf/10.1002/047001332X.ch6.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>E. D.</given-names>
            <surname>Saldanha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Kakas</surname>
          </string-name>
          ,
          <article-title>Cognitive argumentation and the suppression task</article-title>
          , CoRR abs/
          <year>2002</year>
          .10149 (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>R. M. J. Byrne</surname>
          </string-name>
          ,
          <article-title>The rational imagination: How people create alternatives to reality</article-title>
          , MIT press,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>P.</given-names>
            <surname>Lipton</surname>
          </string-name>
          ,
          <article-title>Inference to the Best Explanation</article-title>
          , Routledge,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>D.-H. Ruben</surname>
          </string-name>
          , Explaining Explanation, Routledge,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>H.</given-names>
            <surname>Kelley</surname>
          </string-name>
          ,
          <article-title>The processes of causal attribution</article-title>
          ,
          <source>American Psychologist</source>
          <volume>28</volume>
          (
          <year>1973</year>
          )
          <fpage>107</fpage>
          -
          <lpage>128</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sloman</surname>
          </string-name>
          ,
          <article-title>When explanations compete: the role of explanatory coherence on judgements of likelihood</article-title>
          ,
          <source>Cognition</source>
          <volume>52</volume>
          (
          <year>1994</year>
          )
          <fpage>1</fpage>
          -
          <lpage>21</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>P. M. Fernbach</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Darlow</surname>
            ,
            <given-names>S. A.</given-names>
          </string-name>
          <string-name>
            <surname>Sloman</surname>
          </string-name>
          ,
          <article-title>Neglect of alternative causes in predictive but not diagnostic reasoning</article-title>
          ,
          <source>Psychological Science</source>
          <volume>21</volume>
          (
          <year>2010</year>
          )
          <fpage>329</fpage>
          -
          <lpage>336</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>P. M. Dung</surname>
          </string-name>
          ,
          <article-title>On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-person Games</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>77</volume>
          (
          <year>1995</year>
          )
          <fpage>321</fpage>
          -
          <lpage>357</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Kakas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Moraitis</surname>
          </string-name>
          ,
          <article-title>Argumentation based decision making for autonomous agents</article-title>
          ,
          <source>in: Proc. of Autonomous Agents &amp; Multiagent Systems</source>
          , AAMAS, ACM,
          <year>2003</year>
          , pp.
          <fpage>883</fpage>
          -
          <lpage>890</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>S.</given-names>
            <surname>Modgil</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Prakken</surname>
          </string-name>
          ,
          <article-title>A general account of argumentation with preferences</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>195</volume>
          (
          <year>2013</year>
          )
          <fpage>361</fpage>
          -
          <lpage>397</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>E.-A.</given-names>
            <surname>Dietz Saldanha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kakas</surname>
          </string-name>
          ,
          <article-title>Cognitive argumentation for human syllogistic reasoning</article-title>
          ,
          <source>KI - Künstliche Intelligenz</source>
          <volume>33</volume>
          (
          <year>2019</year>
          )
          <fpage>229</fpage>
          -
          <lpage>242</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Pollock</surname>
          </string-name>
          , Cognitive Carpentry:
          <article-title>A Blueprint for How to Build a Person</article-title>
          , MIT Press,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>D. N.</given-names>
            <surname>Walton</surname>
          </string-name>
          ,
          <article-title>Argumentation Schemes for Presumptive Reasoning</article-title>
          , Lawrence Erlbaum Associates,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>P. M. Dung</surname>
            ,
            <given-names>R. A.</given-names>
          </string-name>
          <string-name>
            <surname>Kowalski</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Toni</surname>
          </string-name>
          ,
          <article-title>Dialectic proof procedures for assumption-based, admissible argumentation</article-title>
          ,
          <source>Artificial Intelligence</source>
          <volume>170</volume>
          (
          <year>2006</year>
          )
          <fpage>114</fpage>
          -
          <lpage>159</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Kakas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Toni</surname>
          </string-name>
          ,
          <article-title>Computing argumentation in logic programming</article-title>
          ,
          <source>Logic Computation</source>
          <volume>9</volume>
          (
          <year>1999</year>
          )
          <fpage>515</fpage>
          -
          <lpage>562</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>E.</given-names>
            <surname>Dietz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. C.</given-names>
            <surname>Kakas</surname>
          </string-name>
          ,
          <article-title>Cognitive argumentation and the selection task</article-title>
          ,
          <source>in: Proceedings of the Annual Meeting of the Cognitive Science Society</source>
          ,
          <volume>43</volume>
          , Cognitive Science Society,
          <year>2021</year>
          , pp.
          <fpage>1588</fpage>
          -
          <lpage>1594</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>