<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Artif. Intell.</journal-id>
<journal-title>Frontiers in Artificial Intelligence</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Artif. Intell.</abbrev-journal-title>
<issn pub-type="epub">2624-8212</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/frai.2023.1130559</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Artificial Intelligence</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Argumentation and explanation in the law</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Rotolo</surname> <given-names>Antonino</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/192249/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Sartor</surname> <given-names>Giovanni</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c002"><sup>&#x0002A;</sup></xref>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Alma AI and Department of Legal Studies, Alma Mater Studiorum - Universit&#x000E0; di Bologna</institution>, <addr-line>Bologna</addr-line>, <country>Italy</country></aff>
<aff id="aff2"><sup>2</sup><institution>Department of Law, European University Institute</institution>, <addr-line>Florence</addr-line>, <country>Italy</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Loizos Michael, Open University of Cyprus, Cyprus</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: John Zeleznikow, La Trobe University, Australia; Markus Ulbricht, Leipzig University, Germany</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Antonino Rotolo <email>antonino.rotolo&#x00040;unibo.it</email></corresp>
<corresp id="c002">Giovanni Sartor <email>giovanni.sartor&#x00040;unibo.it</email></corresp>
</author-notes>
<pub-date pub-type="epub">
<day>04</day>
<month>09</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>6</volume>
<elocation-id>1130559</elocation-id>
<history>
<date date-type="received">
<day>23</day>
<month>12</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>11</day>
<month>08</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2023 Rotolo and Sartor.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Rotolo and Sartor</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license> </permissions>
<abstract>
<p>This article investigates the conceptual connection between argumentation and explanation in the law and provides a formal account of it. To do so, the methods used are conceptual analysis from legal theory and formal argumentation from AI. The contribution and results are twofold. On the one hand, we offer a critical reconstruction of the concept of legal argument, justification, and explanation of decision-making as it has been elaborated in legal theory and, above all, in AI and law. On the other hand, we propose some definitions of explanation in the context of formal legal argumentation, showing a connection between formal justification and explanation. We also investigate the notion of stable normative explanation developed elsewhere in Defeasible Logic and extend some complexity results. Our contribution is thus mainly conceptual, and it is meant to show how notions of explanation from literature on explainable AI and legal theory can be modeled in an argumentation framework with structured arguments.</p></abstract>
<kwd-group>
<kwd>explanation</kwd>
<kwd>argumentation</kwd>
<kwd>legal reasoning</kwd>
<kwd>defeasibility</kwd>
<kwd>normative systems</kwd>
<kwd>justification</kwd>
</kwd-group>
<counts>
<fig-count count="0"/>
<table-count count="0"/>
<equation-count count="24"/>
<ref-count count="85"/>
<page-count count="17"/>
<word-count count="14107"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Machine Learning and Artificial Intelligence</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1. Introduction</title>
<p>Argumentation is critically relevant to law, whose application involves deliberation over the ascertainment of uncertain past facts, as well as the interpretation and application of general legal rules to particular cases, in consideration of relevant values and principles.<xref ref-type="fn" rid="fn0001"><sup>1</sup></xref></p>
<p>Legal problem solving involves dialectical and indeed adversarial interactions in which different ways of reasoning are deployed: probabilistic, deductive and presumptive inferences, the use of analogies, appeals to precedent and policy, and the balancing of interests.</p>
<p>Legal decisions have the authority to be coercively enforced, as issuing from the political community. Thus, such decisions need to be justified: reasons must be provided of why certain claims were endorsed, based on what reasons, and it must be specified why such reasons prevailed over the reasons to the contrary. These justifications need to be critically evaluated, to determine whether they succeed in explaining legal decision in a way that is satisfactory for the individuals involved and for the society.</p>
<p>While legal theory has extensively studied legal argumentation (see Perelman and Olbrechts-Tyteca, <xref ref-type="bibr" rid="B61">1969</xref>; MacCormick, <xref ref-type="bibr" rid="B54">1978</xref>; Alexy, <xref ref-type="bibr" rid="B4">1989</xref>), a formal account of it has only been provided by the AI &#x00026; Law research, which has profited from, and contributed to, the logical tools for argumentation made available within AI (for an overview, see Prakken and Sartor, <xref ref-type="bibr" rid="B67">2015</xref>). In fact, AI &#x00026; Law researchers have not only applied AI-based argumentation techniques to the law, but have also made innovative contributions to the development of formal models of argumentation.</p>
<p>An open research question, which is drawing more and more attention in the literature, is the conceptual and formal investigation of the relation between justification and explanation of legal decisions, especially, when norms are crucial in the reasoning process. This article will mainly address this issue.</p>
<sec>
<title>1.1. Purpose and synopsis of this contribution</title>
<p>We believe there is a still overlooked research challenge, which, taking stock of major achievements in legal theory, concerns the relationship between the &#x0201C;justification of legal arguments&#x0201D; and the &#x0201C;explanation of normative conclusions.&#x0201D; To tackle this issue, we aim to connect two research domains, employing formal argumentation: the investigation of AI &#x00026; Law, which focuses on justifying (automated) legal decision-making, and the examination of explanations within the context of eXplainable AI.</p>
<p>Our contribution is primarily conceptual, aiming to demonstrate how ideas proposed in works such as the one by Miller (<xref ref-type="bibr" rid="B58">2019</xref>) or explored in legal theory can be represented within an argumentation framework.</p>
<p>In the light of the importance of argumentation for the legal domain, this article thus aims at contributing to the following related aspects:</p>
<list list-type="simple">
<list-item><p>- Reconstructing, from the AI &#x00026; Law literature, the main models of legal argument and formal argumentation, and linking these models to the concepts of justification and explanation;</p></list-item>
<list-item><p>- Given the above conceptual background, proposing some definitions of explanation in the context of formal legal argumentation.</p></list-item>
</list>
<p>The layout of the article is as follows. Section 2 clarifies the distinction in the law between justification and explanation. Section 3 develops as follows: after recalling why the law is an argumentation framework (Section 3.1), we will discuss the need to provide explanations when norms are used as preconditions for inferring and issuing other norms (Section 3.2) or for applying them (Section 3.3). We will then consider applications in legal interpretation (Section 3.4) and in case-based reasoning (Section 3.5). Sections 4, 5 offer a conceptual analysis of legal explanation in formal argumentation: the building blocks are recalled in Section 4, while Section 5 presents some definitions of the idea explanation in legal argumentation and investigates the concept of stable explanation extending previous work. Section 6 clarifies the originality of our contributions and discusses related and future work. Some conclusions end the paper.</p></sec></sec>
<sec id="s2">
<title>2. Justification, explanation, and argumentation in legal reasoning</title>
<p>In this section we shall discuss how argumentation has a foundational role with regard to the justification and explanation of normative conclusions.</p>
<sec>
<title>2.1. Justification and explanation in legal decision-making</title>
<p>An extensive discussion of the relation between normative explanation and justification (Baier, <xref ref-type="bibr" rid="B11">1958</xref>, chap. 6) is beyond the scope of this paper. Let us just remark that, while a vast literature exists on the concept of an explanation in philosophy (Achinstein, <xref ref-type="bibr" rid="B1">1983</xref>; Pitt, <xref ref-type="bibr" rid="B62">1988</xref>) legal theory has mainly focused on justification, taking this concept as central in the context of legal decision-making (Alexy, <xref ref-type="bibr" rid="B4">1989</xref>; Peczenik, <xref ref-type="bibr" rid="B60">1989</xref>). From the legal theory perspective, it may seem that explanations are a byproduct of justifications: the arguments justifying a decision, on the basis of facts and norms, also provide an explanation of the same decision.</p>
<p>The connection between explanation and justification has also emerged in AI, where more attention has been devoted to the concept of explanation, especially in the debate on eXplainable AI (XAI) (Miller et al., <xref ref-type="bibr" rid="B59">2022</xref>). The AI &#x00026; Law community has also worked toward explanation, since both &#x0201C;<italic>transparency</italic>&#x0201D; and &#x0201C;<italic>justification</italic>&#x0201D; of (automated) legal decision-making require providing explanations (Atkinson et al., <xref ref-type="bibr" rid="B9">2020</xref>; Governatori et al., <xref ref-type="bibr" rid="B41">2022c</xref>; Prakken and Ratsma, <xref ref-type="bibr" rid="B65">2022</xref>).</p>
<p>Legal decision-making (and consequently, also legal advice) is a complex multi-step process that involves addressing factual and normative issues, based on empirical evidence and legal questions. Different answers to such issues are often possible, depending on the ethical and political preferences and the psychological attitudes of the decision-makers. The extent to which such preferences and attitudes may determine the outcome of the case is constrained by the available evidence and applicable norms. However, a space for discretion, broadly understood, remains, and this space is adjustable, since constraints themselves are to be interpreted by the decision-makers, according to their view of the role of decision-maker (typically judges) and of the principle of the separation of powers.</p>
<p>Within an argumentation-based approach, <italic>the justification of a legal decision may be viewed as an argument structure aimed to show that the decision is right or correct, according to a convincing reconstruction of facts and norms</italic>. Justifications are pervasive in the law, since, as noted above, legal decision-makers are usually required to publicly provide rational grounds for the normative correctness of their decisions (at least for important ones). Justifications may also be produced, possibly integrating the original ones, at a subsequent time, by those who agree with such decisions and want to provide further reasons supporting them.</p>
<p>Consider for instance Dobbs v. Jackson Women&#x00027;s Health Organization, 19-1392 U.S. 597 (2022) decision by the US Supreme Court, which denied the existence of a constitutional right to abortion, contrary to the previous Roe v. Wade, 410 U.S. 113 (1973) decision, which had affirmed that right. The majority of the Dobbs judges provided a justification of that decision based on certain legal doctrines on the interpretation of the US constitution (a version of the so-called originalism), on federalism, on the separation of powers, which require according to their view that the legality of abortion is decided at the State level, rather than at the federal level. More extended justifications of that decisions have been provided by legal scholars who agree with its content and want to support its correctness with further considerations. On the other hand, the judges in the dissenting opinion strongly criticized this justification, and so did scholars and activists opposing the Dobbs decision.</p>
<p>In legal theory it is common to distinguish the &#x0201C;discovery&#x0201D; process through which decision-makers endorse certain conclusions on the relevant issues&#x02014;guided by the information they access, but also by their intuitions and by their tacit expert knowledge&#x02014;and the process of building an accessible justification of that decision, which may appear convincing or at least acceptable to the parties and the public (MacCormick, <xref ref-type="bibr" rid="B54">1978</xref>). Justification usually follows discovery, and selectively uses the information elicited during discovery, in order to provide a rhetorically effective account. However, dialectical interactions between the two processes exist: on the one hand considerations developed during the discovery process may enter into the justification, on the other hand the necessity to build a convincing justification may guide the process of discovery, leading the decision-makers to reject or amend the outcomes for which a convincing justification could not be found.</p>
<p>It seems to us that in any case a description of the discovery process is no substitute for a justification as just described: first of all, many aspects of the process of discovery are not accessible to description, pertaining to the unconscious working of the decision-maker&#x00027;s mind; secondly, some moves in the discovery process may pertain to taking wrong directions, or anyway to aspects that are not relevant for the goal of providing a publicly acceptable justification. On the other hand, however, certain inference steps that took place during discovery (including logical and statistical inferences, the assessment of competing factors, the interaction of rules and exceptions, presumption, etc.) can be recovered for the purpose of building a justification.</p></sec>
<sec>
<title>2.2. Types of legal explanation: conceptual distinctions</title>
<p>While <italic>justifications are reasoned defenses of (legal) decisions</italic> by the authors of such decisions or third parties supporting the same decisions, <italic>explanations involve a third-party perspective</italic>, which does not presuppose the endorsement of the explained decisions (for a general philosophical discussion, see Davidson, <xref ref-type="bibr" rid="B30">1963</xref>).</p>
<p>We may indeed distinguish two ways of explaining legal decisions: <italic>causal explanations</italic>, and <italic>rational reconstructions</italic>.</p>
<p>Causal explanations of legal decisions aim at identifying social, ideological, or political factors that contribute to the outcomes of legal cases, inducing decision-makers to adopt such outcomes. For instance, in the Dobb case we might consider that the outcome was determined by the political position of the majority of the judges (positioned in the right-wing side and nominated by republican presidents), their religious convictions, their ideological commitments, their connections with certain groups of the population, etc. In some cases, the causal explanation may include pointing to failures in the decisional process: the decision-makers were affected by their prejudices, were bribed, their decision was instrumental to favoring their friends or harm their enemies, etc.</p>
<p>This <italic>extra-legal and extra-systemic explanation</italic> of legal decisions can be distinguished from the <italic>intra-legal and intra-systemic rational explanation</italic> (i.e., a rational reconstruction), by which we may understand the attempt to identify reasons why certain decisions may be legally appropriate, given the beliefs, view-point and political-ethical-legal commitments of those who support such decisions (and first of all of the decision-makers who adopted them). A broad notion, which fits with our analysis, is proposed by V&#x000E4;yrynen (<xref ref-type="bibr" rid="B79">2021</xref>) for whom normative explanations are &#x0201C;explanations of why things are wrong, good, or unfair.&#x0201D; In the context of legal decision-making, we may say that a normative explanation is an account of why a legal evaluation (on the legality, illegality of action, the ascription of rights or obligations) is considered to be correct on the basis of <italic>both norms and facts</italic> (a combination that was first emphasized by Schroeder, <xref ref-type="bibr" rid="B77">2005</xref>).</p>
<p><italic>Rational explanations, as well as justifications can take the shape of an argumentation framework</italic>, in which, besides presenting the arguments favoring the decision, arguments to the contrary are considered and defeated. This perspective involves a &#x0201C;principle of charity,&#x0201D; in the sense that it is assumed that the decision is the outcome of reasoned factual and legal considerations, even though we may disagree with the substance of such considerations. Thus, those who disagree with the Dobbs decision, can still provide a rational explanation (reconstruction) of that decision by presenting a coherent narrative including legally relevant reasons in favor of that decision, together with the assessment of such reasons according to the perspective of those who endorse them. Nevertheless, the opponents of the same decision may continue to consider that it was wrong, since stronger reasons, according to their perspective, exist for reaching the opposite conclusion. The opponent of Dobbs can also merge their critical considerations with the rational explanation of the decision they disagree with. In such a case, a critical argumentation framework is obtained, in which the arguments explaining the decision are defeated by the arguments against that decision (consider for instance, a legal essay that attacks the conclusion as well as the reasoning of the judges in the Dobbs case).</p></sec>
<sec>
<title>2.3. Our conceptual standpoint</title>
<p>In conclusion, it seems to us that both the justification of a legal decision and its rational explanation, as described above, can be captured through argumentation. Both ideas presuppose that an outcome (the decision of a case) should be supported by reasons, and that these reasons should prevail over the reason to the contrary, according to a certain perspective. The <italic>distinction between justification and rational explanation, according to our analysis, pertains to pragmatics, rather than to semantics</italic>. It concerns the purpose of the exercise: providing support to a decision we endorse (being those who propose it, or aim to advance or defend it) or rather accounting for the support that is attributed to a decision by those who endorse it, for reasons endorsed by them. In the following, when speaking of explanations, without further clarifications, we cover both justifications and rational explanations.</p>
<p>The distinction between justification and (rational) explanation thus seems to rely on a perspectival approach. For an agent <italic>a</italic><sub>1</sub>: (a) a decision <italic>d</italic> (by <italic>a</italic><sub>1</sub> or by other agents) is justified iff it is supported by prevailing reasons in the context of the attitudes and beliefs of <italic>a</italic><sub>1</sub>; (b) a decision <italic>d</italic> by an agent <italic>a</italic><sub>2</sub> is (rationally) explained if it is supported by prevailing reasons in the context of the attitudes and beliefs of <italic>a</italic><sub>2</sub>.</p>
<p>In the context of the application of AI technologies to legal decision-making the relation between discovery (the activity through which a system constructs an answer to a legal issue) and justification-explanation (the attempt to provide reasons for that answer) tends to take a different form in knowledge-based systems (including formal-argumentation system), on the one hand, and in opaque machine learning applications, on the other hand. In the first case, the argumentative justification-explanation of a case can be constructed on the basis of the very inferences and reasoning patterns through which the system came to determine its outcome; in the second case an argumentative justification-explanation has to constructed as a parallel exercise, meant to mimic the opaque inference of the system. In both cases, the construction of argumentative explanations presupposes the availability of a knowledge base of rules and concepts, from which arguments can be constructed.</p>
<p>In this paper, we shall assume that such a knowledge-base is available, and we shall consider to what extent it can be used to build argumentation frameworks. Given an argumentation framework we shall consider, by deploying an argumentation semantics, what arguments and conclusions are supported by that framework, where this notion of support may be viewed as a kind of justification: an outcome is justified by the (grounded) extension or labeling in which it is included. Based on this idea, we shall provide some notions that clarify aspects of legally relevant explanations.</p>
<p>First, we shall discuss whether an explanation can be viewed as an argument set that is suitable to support the explanandum (within the given argumentation framework): if any arguments in the set were not available the explanandum would not be derived, through that explanation.</p>
<p>Focusing especially on factual premises and norms, we shall then consider contrastive explanations, which elicit, under minimality conditions, those facts or norms whose presence or removal would preempt the derivation of the explanandum.</p>
<p>We are aware that our analysis cannot cover all aspects that are addressed under philosophical conceptions of a (normative) explanation, but we believe we will provide a sufficiently rich account that makes an essential use of the distinctive elements the legal knowledge base.</p></sec></sec>
<sec id="s3">
<title>3. Models of legal argument</title>
<p>The adoption of argumentative model for the justification-explanation of legal decisions was motivated by the fact that purely deductive approaches fail to capture key aspects of legal reasoning, such as conflicts between competing rules, the relation between rules and exceptions, the significance of factors, interpretive and case-based reasoning, and more generally, the dialectical and adversarial nature of legal interactions (Perelman and Olbrechts-Tyteca, <xref ref-type="bibr" rid="B61">1969</xref>; Alexy, <xref ref-type="bibr" rid="B4">1989</xref>; Walton et al., <xref ref-type="bibr" rid="B84">2008</xref>; Bongiovanni et al., <xref ref-type="bibr" rid="B20">2018</xref>).</p>
<p>Argumentation pervades all the three dimensions of the law distinguished by Hart (<xref ref-type="bibr" rid="B45">1994</xref>):</p>
<list list-type="simple">
<list-item><p>- <bold>Norm recognition and hierarchies:</bold> legal systems consist of norms and provide criteria for establishing whether any norms belong to them; legal systems assign to their norms a different ranking status and organize them in hierarchies (e.g., constitutional norms are stronger than legislative acts);</p></list-item>
<list-item><p>- <bold>Norm change:</bold> legal systems change and include criteria governing their dynamical evolution;</p></list-item>
<list-item><p>- <bold>Norm application:</bold> the norms in a legal system are applied to concrete cases, and this process is based on interpretive and procedural criteria specified by that system.</p></list-item>
</list>
<p><italic>In a reasoning and argumentative perspective</italic>, we can think of the above dimensions as follows:</p>
<list list-type="simple">
<list-item><p>- Arguments can be used for inferring, issuing, or adopting norms, and for determining how norms are related with one another (e.g., for establishing when one norm may override another one in case of conflicts; <bold>Norm recognition and hierarchies</bold>);</p></list-item>
<list-item><p>- Arguments can be used for proposing and implementing revisions to legal systems (<bold>Norm change</bold>);</p></list-item>
<list-item><p>- Arguments can be used for advancing interpretations of legal provisions, supporting them against alternative interpretations (e.g., when different interpretive canons, as applied to the same provision, offer different legal solutions for the same case) and for applying the resulting norms (<bold>Norm application</bold>).</p></list-item>
</list>
<p>In the following, we briefly recall the main contribution of argumentation theory in AI &#x00026; Law to some of these dimensions and identify some challenges to be addressed in regard to the distinction between justification and explanation.</p>
<sec>
<title>3.1. The law as an argumentation framework</title>
<p>It has been argued that the law itself can be described as a complex argumentation framework (Prakken and Sartor, <xref ref-type="bibr" rid="B67">2015</xref>). Under this general assumption, arguments must determine (and thus explain) the way in which <italic>norms interplay with one another in legal systems</italic> (Alchourron and Bulygin, <xref ref-type="bibr" rid="B2">1971</xref>). Defeasible argumentation (Dung, <xref ref-type="bibr" rid="B32">1995</xref>; Pollock, <xref ref-type="bibr" rid="B63">1995</xref>) has indeed been used to address conflicts between norms and ways to resolve such conflicts through meta-arguments, as well as the interactions between legal rules and the reasons supporting them (Hage, <xref ref-type="bibr" rid="B44">1997</xref>; Prakken and Sartor, <xref ref-type="bibr" rid="B67">2015</xref>).</p>
<p>Through formal argumentation, among others, the following challenges can be addressed:</p>
<list list-type="simple">
<list-item><p>- Explaining the interplay of legal norms. When there is a conflict of legal rules <italic>r</italic><sub>1</sub> and <italic>r</italic><sub>2</sub>, both applicable to the case at hand, then a decision for <italic>r</italic><sub>1</sub>&#x00027;s outcome must include a preference for <italic>r</italic><sub>1</sub> and possibly reasons for that preference.</p></list-item>
<list-item><p>- Explaining the application of norms. In deciding a case a procedure has to be followed where facts have be assessed in compliance with legal constraints, rules have to be identified and their applicability assessed.</p></list-item>
<list-item><p>- Explaining the interpretation of legal norms. When alternative interpretations <italic>i</italic><sub>1</sub> and <italic>i</italic><sub>2</sub> of a legal provision exist, then a decision for the outcome corresponding to <italic>i</italic><sub>1</sub> must be supported by the reasons why <italic>i</italic><sub>1</sub> rather than <italic>i</italic><sub>2</sub> should be accepted as the interpretation of that provision.</p></list-item>
</list></sec>
<sec>
<title>3.2. Explaining the interplay of legal norms</title>
<p>Let us first consider the need to provide explanations where norms are used for inferring, issuing, or applying other norms.</p>
<p>Assume that norms in the legal system <italic>L</italic> are represented as rules of the form <italic>r</italic>:<italic>&#x003D5;</italic><sub>1</sub>, &#x02026;, <italic>&#x003D5;</italic><sub><italic>n</italic></sub>&#x021D2;&#x003C8; (where <italic>r</italic> is the name of the norm). Then a preference relation &#x0003E; can capture a hierarchy over <italic>L</italic> that enables collisions between norms being addressed. Consider for example</p>
<disp-formula id="E1"><mml:math id="M1"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mi>r</mml:mi><mml:mo>:</mml:mo><mml:msub><mml:mi>&#x003D5;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x003D5;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mi>s</mml:mi><mml:mo>:</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mi>&#x003C0;</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mi>t</mml:mi><mml:mo>:</mml:mo><mml:mi>&#x003C9;</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C0;</mml:mi><mml:mo>&#x0007D;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x0003E;</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mo>&#x02329;</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>&#x0232A;</mml:mo><mml:mo>&#x0007D;</mml:mo><mml:mo>&#x0007D;</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Assume also that the antecedents of <italic>r</italic> and <italic>t</italic>, i.e., facts <italic>&#x003D5;</italic><sub>1</sub>, &#x02026;, <italic>&#x003D5;</italic><sub><italic>n</italic></sub>, &#x003C9; are the case. Because <italic>s</italic> is hierarchically superior to <italic>t</italic>, then an argument <italic>A</italic> concatenating <italic>&#x003D5;</italic><sub>1</sub>, &#x02026;, <italic>&#x003D5;</italic><sub><italic>n</italic></sub>, <italic>r</italic> and <italic>s</italic> successfully supports the conclusion &#x003C0;, defeating the argument concatenating &#x003C9; and <italic>t</italic>. Jurists usually would say that this argument legally grounds and justifies &#x003C0; in <italic>L</italic>. Notice that the law &#x0201C;is not concerned with the absolute rationality of the normative statement in question, but only with showing that it can be rationally justified within the framework of the validly prevailing legal order&#x0201D; (Alexy, <xref ref-type="bibr" rid="B4">1989</xref>, p. 220). This simple context illustrates different legally relevant explanations of &#x003C0;. We may say that conclusion &#x003C0; is explained:</p>
<list list-type="simple">
<list-item><p>- By argument <italic>A</italic>, which grounds conclusion &#x003C0; upon the relevant facts;</p></list-item>
<list-item><p>- By the whole of <italic>L</italic> plus all facts of the case, which together provide for the conflicting arguments and for the preference solving their conflict;</p></list-item>
<list-item><p>- By each fact in <italic>&#x003D5;</italic><sub>1</sub>, &#x02026;, <italic>&#x003D5;</italic><sub><italic>n</italic></sub>, since one may counterfactually argue that without any of them we would have &#x000AC;&#x003C0; rather than &#x003C0;;</p></list-item>
<list-item><p>- By each of the rules <italic>r</italic> and <italic>s</italic>, since without either of them &#x003C0; could not be (sceptically) inferred;</p></list-item>
<list-item><p>- By the preference <italic>s</italic> &#x0003E; <italic>t</italic>, without which also &#x003C0; could not be inferred.</p></list-item>
</list></sec>
<sec>
<title>3.3. Explaining the application of the law</title>
<p>When the law is applied to cases (e.g., by judges in courts), legal theory traditionally breaks down the analysis of judicial decisions into three dimensions: the so-called question of fact (<italic>quaestio facti</italic>), i.e., reconstructing the facts of the case on the basis of the available evidence, the ways in which proceedings develop (judicial procedures), and the so-called question on law (<italic>quaestio juris</italic>), i.e., interpreting the law to identify the applicable legal rule. Within AI &#x00026; Law, an in-depth analysis has been developed of evidential reasoning, comparing different approaches to it (Verheij et al., <xref ref-type="bibr" rid="B80">2016</xref>). The procedural aspects of decisions have been investigated in regard to ideas such as the standard of proofs, presumptions, and burdens of proof (Prakken and Sartor, <xref ref-type="bibr" rid="B70">2006</xref>; Calegari and Sartor, <xref ref-type="bibr" rid="B26">2021</xref>; Kampik et al., <xref ref-type="bibr" rid="B48">2021</xref>). Formalizations have also been developed for protocols governing the admissibility and impact of arguments in legal debates (Gordon, <xref ref-type="bibr" rid="B34">1995</xref>; Governatori et al., <xref ref-type="bibr" rid="B42">2014</xref>). More recently, the idea that multiple argument schemes can be used in legal arguments has been explored, as well as the issue of which argumentative strategies are most effective in different legal disputes from a game-theoretical perspective (Roth et al., <xref ref-type="bibr" rid="B73">2007</xref>; Riveret et al., <xref ref-type="bibr" rid="B72">2008</xref>).</p>
<p>Jurists naturally resort to <italic>causal explanation</italic> in the context of reasoning about evidence (Walton, <xref ref-type="bibr" rid="B81">2002</xref>), where competing accounts of the facts of the case are developed on the basis of the available evidence. In this domain, AI &#x00026; Law research has devoted an extensive effort and discussed classic issues such as the relation between abductive and counterfactual reasoning and legal argumentation (see, again Prakken and Sartor, <xref ref-type="bibr" rid="B67">2015</xref> for an overview of the literature, see Liepina et al., <xref ref-type="bibr" rid="B50">2020</xref> for a recent attemp di identify causal argument schemes for causal reasoning).</p>
<p>Logical models have also been used to relate legal norms to the cases at hand and explain why such norms are applicable to the given facts. One framework that has been developed for this purpose is called reason-based logic (RBL), which focuses on how principles, goals, and rules can influence the interpretation of legal provisions (Hage, <xref ref-type="bibr" rid="B44">1997</xref>).</p></sec>
<sec>
<title>3.4. Explaining the interpretation of the law</title>
<p>Legal interpretation has been viewed as a decision-making problem, in which the goal is to choose the best interpretation based on its consequences for promoting and demoting values (Atkinson and Bench-Capon, <xref ref-type="bibr" rid="B10">2007</xref>; da Costa Pereira et al., <xref ref-type="bibr" rid="B29">2017</xref>). Another approach is the argument-scheme approach, which considers interpretive canons using defeasible rules to interpret legal provisions and resolving conflicts by comparing the reasons behind different interpretations (Rotolo et al., <xref ref-type="bibr" rid="B74">2015</xref>; Walton et al., <xref ref-type="bibr" rid="B83">2021</xref>). The latter idea fits legal theories that view interpretive canons as reasoning patterns for constructing arguments aimed at justifying interpretive outcomes. Examples of canons by MacCormick and Summers (<xref ref-type="bibr" rid="B55">1991</xref>) are:</p>
<list list-type="simple">
<list-item><p><bold>Argument from ordinary meaning</bold>: if a statutory provision can be interpreted according to the meaning a native speaker of a given language would ascribe to it, it should be interpreted in this way, unless there is a reason for a different interpretation.</p></list-item>
<list-item><p><bold>Argument by coherence</bold>: a provision should be interpreted in light of the whole statute it is part of, or in light of other provisions it is related to.</p></list-item>
<list-item><p><bold>Teleological argument</bold>: a provision should be interpreted as applied to a particular case in a way compatible with the purpose that the provision is supposed to achieve.</p></list-item>
<list-item><p><bold>Arguments from general principles</bold>: whenever general principles, including principles of law, are applicable to a provision, one should favor the interpretation that is most in conformity with these general legal principles.</p></list-item>
</list>
<p>According to Rotolo et al. (<xref ref-type="bibr" rid="B74">2015</xref>) and Walton et al. (<xref ref-type="bibr" rid="B83">2021</xref>), the structure of interpretive arguments can be analyzed using <italic>interpretation rules</italic>, where the antecedent of interpretation rules can be of any type, while the conclusion is an interpretive act <inline-formula><mml:math id="M2"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula> of a provision <italic>n</italic> leading to an interpretive result &#x003C8; for <italic>n</italic> which expresses such an interpretation paraphrasing <italic>n</italic> into &#x003C8;. An example of an interpretation rule is the following:</p>
<disp-formula id="E2"><label>(1)</label><mml:math id="M3"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>:</mml:mo><mml:mi>&#x003D5;</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>&#x003D5;</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Rule <italic>r</italic>&#x02032; states that, if <italic>&#x003D5;</italic><sub>1</sub>, &#x02026;, <italic>&#x003D5;</italic><sub><italic>n</italic></sub> hold, then the interpretive canon to be applied in legal system <italic>L</italic> for provision <italic>n</italic><sub>1</sub> is the teleological interpretation, which returns &#x003C8;.</p>
<p>Now suppose to have the following rules (the example logically mirrors the one in Section 3.2):</p>
<disp-formula id="E3"><mml:math id="M4"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:msub><mml:mi>&#x003D5;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>&#x003D5;</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>&#x021D2;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>n</mml:mi><mml:mn>1</mml:mn><mml:mi>L</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msup><mml:mi>s</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>n</mml:mi><mml:mn>1</mml:mn><mml:mi>L</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x021D2;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>n</mml:mi><mml:mn>2</mml:mn><mml:mi>L</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mi>&#x003C0;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msup><mml:mi>t</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:mo>&#x021D2;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>n</mml:mi><mml:mn>2</mml:mn><mml:mi>L</mml:mi></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C0;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x0007D;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x0003E;</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>t</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>&#x0232A;</mml:mo><mml:mo>&#x0007D;</mml:mo><mml:mo>&#x0007D;</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>In legal theory, we may say that the interpretation of <italic>n</italic><sub>2</sub> as &#x003C0; is justified in the legal system <italic>L</italic> (on modeling interpretation through argumentation, see Walton et al., <xref ref-type="bibr" rid="B83">2021</xref>; Sartor, <xref ref-type="bibr" rid="B76">2023</xref>). We may also say that the argument built with <italic>r</italic>&#x02032; and <italic>s</italic>&#x02032; explains this outcome, or, also, that <italic>&#x003D5;</italic><sub>1</sub>, &#x02026;, <italic>&#x003D5;</italic><sub><italic>n</italic></sub> explain it.</p></sec>
<sec>
<title>3.5. Explaining the use of judicial cases</title>
<p>Legal systems often rely on past cases to guide decision-making and legal reasoning. A popular AI &#x00026; Law approach to case-based reasoning consists in focusing on factors, namely, on features of cases that favor or disfavor certain outcomes (Rissland and Ashley, <xref ref-type="bibr" rid="B71">1987</xref>; Ashley, <xref ref-type="bibr" rid="B8">1990</xref>; Ashley and Aleven, <xref ref-type="bibr" rid="B7">1991</xref>). The presence or absence of certain factors in a new case, or in precedents cases, can be used to support or challenge legal claims. There have been various developments of the factor-based approach within AI &#x00026; Law, including the use of multivalued factors (Bench-Capon and Rissland, <xref ref-type="bibr" rid="B13">2002</xref>) and hierarchies of factors (Aleven and Ashley, <xref ref-type="bibr" rid="B3">1997</xref>), as well as logical mechanisms for determining when a decision is consistent or inconsistent with a case base (Horty, <xref ref-type="bibr" rid="B47">2011</xref>).</p>
<p>Investigations have been developed on the combination of models of case-based reasoning with formal approaches to defeasible argumentation (Berman and Hafner, <xref ref-type="bibr" rid="B16">1993</xref>; Bench-Capon and Sartor, <xref ref-type="bibr" rid="B14">2003</xref>; Bench-Capon et al., <xref ref-type="bibr" rid="B15">2013</xref>; Maranh&#x000E3;o et al., <xref ref-type="bibr" rid="B57">2021</xref>). Accordingly, a case can be reconstructed as expressing two competing rules and a preference for one of them (Prakken and Sartor, <xref ref-type="bibr" rid="B66">1998</xref>): the conjunction of the factors <italic>&#x003D5;</italic><sub>1</sub>, &#x02026;, <italic>&#x003D5;</italic><sub><italic>n</italic></sub> which are present in the case and support its outcome &#x003C8; corresponds to a defeasible rule <italic>&#x003D5;</italic><sub>1</sub>, &#x02026;, <italic>&#x003D5;</italic><sub><italic>n</italic></sub>&#x021D2;&#x003C8;, which prevails over the rule &#x003C7;<sub>1</sub>, &#x02026;, &#x003C7;<sub><italic>m</italic></sub>&#x021D2;&#x000AC;&#x003C8;, whose antecedent is the conjunction of all factors &#x003C7;<sub>1</sub>, &#x02026;, &#x003C7;<sub><italic>m</italic></sub> in the case which support the outcome &#x000AC;&#x003C8;. The rules involved in factor-based reasoning are defeasible in that new factors can explain deviations from earlier decisions.</p>
<p>In Liu et al. (<xref ref-type="bibr" rid="B52">2022a</xref>) case-based reasoning and classifier systems are connected, and on this basis different kinds of case-based explanations are defined such as abductive and contrastive ones. The logic of Liu et al. (<xref ref-type="bibr" rid="B52">2022a</xref>) is based on modal logic and does not directly capture the argumentative nature of case-based reasoning, as recalled above. Prakken and Ratsma (<xref ref-type="bibr" rid="B65">2022</xref>) uses argumentation&#x02014;based on multi-valued factors (dimensions)&#x02014;to explain the outcome of legal cases.</p></sec></sec>
<sec id="s4">
<title>4. Formal argumentation</title>
<p>In this section we present formal argumentation and illustrate its application to legal reasoning. Argumentation frameworks have been proposed by Dung (<xref ref-type="bibr" rid="B32">1995</xref>) to investigate the general aspects of dialectical reasoning without specifying the internal structure of arguments. Many semantic models have been developed (Baroni and Giacomin, <xref ref-type="bibr" rid="B12">2009</xref>) for abstract argumentation. Such models determine what arguments can be accepted, by considering not only how such arguments directly conflict with each other, but also how arguments can be indirectly defended by other arguments. Among them, several options have been acknowledged as appropriate in legal reasoning (see Prakken and Sartor, <xref ref-type="bibr" rid="B68">2023</xref>). However, since we work in this paper on argumentation for reasoning with norms, we follow Governatori et al. (<xref ref-type="bibr" rid="B43">2021</xref>) and Governatori and Rotolo (<xref ref-type="bibr" rid="B35">2023</xref>). These works suggest that when norms collide and no priority principles can apply (such as the principles <italic>lex superior, lex posterior</italic> and <italic>lex specialis</italic>), a skeptical approach may be the most appropriate one, especially when legal effects of norms are obligations or sanctions. For the sake of simplicity, we focus on grounded semantics.</p>
<p>Let us first of all recall from the literature some basic formal concepts.</p>
<p>Definition 1 (<bold>Argumentation framework and semantics</bold>).</p>
<list list-type="simple">
<list-item><p><bold><italic>Argumentation framework</italic></bold>. An argumentation framework <inline-formula><mml:math id="M5"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula> is a pair (<inline-formula><mml:math id="M6"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, &#x0226B;) where <inline-formula><mml:math id="M7"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is a set of arguments, and &#x0226B;&#x02286;<inline-formula><mml:math id="M8"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x000D7;<inline-formula><mml:math id="M9"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is a binary, attack relation.</p></list-item>
<list-item><p><bold><italic>Conflict-free set</italic></bold>. A set S of arguments is said to be conflict-free if, and only if there are no arguments <italic>A</italic> and <italic>B</italic> in <inline-formula><mml:math id="M10"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> such that <italic>B</italic> attacks <italic>A</italic>.</p></list-item>
<list-item><p><bold><italic>Argument defense</italic></bold>. Let <inline-formula><mml:math id="M11"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x02286;<inline-formula><mml:math id="M12"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>. The set <inline-formula><mml:math id="M13"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> <italic>defends</italic> an argument <italic>A</italic>&#x02208;<inline-formula><mml:math id="M14"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> if, and only if for each argument <italic>B</italic> attacking <italic>A</italic> there is an argument <italic>C</italic>&#x02208;<inline-formula><mml:math id="M15"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> that attacks <italic>B</italic>.</p></list-item>
<list-item><p><bold><italic>Complete extension</italic></bold>. Let <inline-formula><mml:math id="M16"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula> &#x0003D; (<inline-formula><mml:math id="M17"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, &#x0226B;) and <inline-formula><mml:math id="M18"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x02286;<inline-formula><mml:math id="M19"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math id="M20"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is a complete extension of <inline-formula><mml:math id="M21"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula> if and only if <inline-formula><mml:math id="M22"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is conflict-free and <inline-formula><mml:math id="M23"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> &#x0003D; {<italic>A</italic>&#x02208;<inline-formula><mml:math id="M24"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>|<inline-formula><mml:math id="M25"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>S</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>defends<italic>A</italic>}.</p></list-item>
<list-item><p><bold><italic>Grounded extension</italic></bold>. A grounded extension <italic>GE</italic>(<inline-formula><mml:math id="M26"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>) of an argumentation framework <inline-formula><mml:math id="M27"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula> is the minimal complete extension of <inline-formula><mml:math id="M28"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p><bold><italic>Justified argument and conclusion</italic></bold>. An argument <italic>A</italic> and its conclusion <inline-formula><mml:math id="M29"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Conc</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) are justified w.r.t. an argumentation framework <inline-formula><mml:math id="M30"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula> if, and only if <italic>A</italic>&#x02208;<italic>GE</italic>(<inline-formula><mml:math id="M31"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>).</p></list-item>
<list-item><p><bold><italic>Rejected argument and conclusion</italic></bold>. An argument <italic>A</italic> and its conclusion <inline-formula><mml:math id="M32"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Conc</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) are rejected w.r.t. an argument framework <inline-formula><mml:math id="M33"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula> is, and only if <italic>A</italic>&#x02209;<italic>GE</italic>(<inline-formula><mml:math id="M34"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>).</p></list-item>
</list>
<p>While abstract argumentation is not concerned with the internal structure of arguments, it was argued in the AI &#x00026; Law literature the importance of devising argumentation frameworks where arguments have a logical structure (see Sartor, <xref ref-type="bibr" rid="B75">2005</xref>; Prakken and Sartor, <xref ref-type="bibr" rid="B67">2015</xref>; Governatori et al., <xref ref-type="bibr" rid="B43">2021</xref>). If the underlying language of an argumentation framework refers to any logic <bold><italic>L</italic></bold>, arguments can roughly correspond to proofs in <bold><italic>L</italic></bold> (Prakken and Vreeswijk, <xref ref-type="bibr" rid="B69">2002</xref>). As done by Governatori et al. (<xref ref-type="bibr" rid="B37">2004</xref>), Prakken (<xref ref-type="bibr" rid="B64">2010</xref>), and Toni (<xref ref-type="bibr" rid="B78">2013</xref>), given the above framework the (internal) logical structure of arguments can be specified using rule-based systems in such a way that rules correspond, e.g., to norms or normative reasoning patterns (such as in the case of interpretation rules) (Sartor, <xref ref-type="bibr" rid="B75">2005</xref>; Prakken and Sartor, <xref ref-type="bibr" rid="B67">2015</xref>; Governatori et al., <xref ref-type="bibr" rid="B43">2021</xref>) and arguments are logical inference trees built from them.</p>
<p>Definition 2 (<bold>Language</bold>). The language consists of <italic>literals</italic> and <italic>defeasible rules</italic>. Given a set PROP of propositional atoms, the set of <italic>literals</italic> is Lit &#x0003D; PROP&#x0222A;{&#x000AC;<italic>p</italic> | <italic>p</italic>&#x02208;PROP}. We denote with &#x0007E;<italic>&#x003D5;</italic> the <italic>complementary</italic> of literal <italic>&#x003D5;</italic>; if <italic>&#x003D5;</italic> is a positive literal &#x003C8;, then &#x0007E;<italic>&#x003D5;</italic> is &#x000AC;&#x003C8;, and if <italic>&#x003D5;</italic> is a negative literal &#x000AC;&#x003C8;, then &#x0007E;<italic>&#x003D5;</italic> is &#x003C8;.</p>
<p>Let Lab be a set of unique rule labels. A <italic>defeasible rule</italic> <italic>r</italic> with <italic>r</italic>&#x02208;Lab has the form <inline-formula><mml:math id="M35"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Ant</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>r</italic>)&#x021D2;<inline-formula><mml:math id="M146"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mtext>Head</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>r</italic>), where</p>
<list list-type="simple">
<list-item><p>- <inline-formula><mml:math id="M36"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Ant</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>r</italic>), called the <italic>antecedent</italic> or the <italic>premises</italic> of <italic>r</italic>, is a subset of Lit (which may be empty) and</p></list-item>
<list-item><p>- <inline-formula><mml:math id="M147"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mtext>Head</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>r</italic>) is a literal in Lit, called the <italic>consequent</italic> or <italic>head</italic> of <italic>r</italic>.</p></list-item>
</list>
<p>If <italic>R</italic> is a set of rules,</p>
<list list-type="simple">
<list-item><p>- <italic>R</italic>[<italic>&#x003D5;</italic>] is the set of rules in <italic>R</italic> with head <italic>&#x003D5;</italic>,</p></list-item>
<list-item><p>- <inline-formula><mml:math id="M37"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>ANT</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>R</italic>) is the union of all antecedents of all rules in <italic>R</italic> (i.e., it contains all literals in the antecedents of such rules).</p></list-item>
</list>
<p>Any defeasible rule whose antecedent is satisfied provides sufficient support to its conclusion unless there is evidence contrary to that conclusion.<xref ref-type="fn" rid="fn0002"><sup>2</sup></xref></p>
<p>Following Governatori et al. (<xref ref-type="bibr" rid="B37">2004</xref>) we use the term argumentation theory to denote the rule-based knowledge from which argumentation frameworks are built. Notice that, as done by Antoniou et al. (<xref ref-type="bibr" rid="B6">2001</xref>), we distinguish a set of indisputable statements called <italic>facts</italic>, even though, without loss of generality, we impose some restrictions on it to keep things simpler.</p>
<p>Definition 3 (<bold>Argumentation theory</bold>). An <italic>argumentation theory</italic> <italic>D</italic> is a structure</p>
<disp-formula id="E4"><mml:math id="M38"><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>R</mml:mi><mml:mo>,</mml:mo><mml:mi>F</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x0003E;</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where</p>
<list list-type="simple">
<list-item><p>- <italic>R</italic> is a (finite) set of defeasible rules,</p></list-item>
<list-item><p>- <italic>F</italic> &#x02286; Lit is a consistent set of indisputable statements called <italic>facts</italic> such that, for each &#x003C6;&#x02208;<italic>F</italic>, <italic>R</italic>[&#x003C6;]&#x0222A;<italic>R</italic>[<italic>&#x0007E;&#x003C6;</italic>]=&#x02205;, and</p></list-item>
<list-item><p>- &#x0003E;&#x02286;<italic>R</italic>&#x000D7;<italic>R</italic> is a binary relation on <italic>R</italic> called <italic>superiority relation</italic>.</p></list-item>
</list>
<p>The relation &#x0003E; describes the relative strength of rules, that is to say, when a single rule may override the conclusion of another rule; it is required to be irreflexive, asymmetric and acyclic (i.e., its transitive closure is irreflexive).</p>
<p>By combining the rules in a theory, we can build arguments [we adjust the definition by Prakken (<xref ref-type="bibr" rid="B64">2010</xref>) to meet Definition 3]. Let us first introduce some notation: for a given argument <italic>A</italic>, <inline-formula><mml:math id="M39"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Conc</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) returns <italic>A</italic>&#x00027;s conclusion, <inline-formula><mml:math id="M40"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Sub</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) returns all its sub-arguments, <inline-formula><mml:math id="M41a"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Rules</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) returns all the rules in the argument and, finally, <inline-formula><mml:math id="M41"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>TopRule</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) returns the last inference rule in <italic>A</italic>.</p>
<p>Definition 4 (<bold>Argument</bold>). Let <italic>D</italic> &#x0003D; (<italic>R, F</italic>, &#x0003E;) be an argumentation theory. An argument <italic>A</italic> for <italic>&#x003D5;</italic> constructed from <italic>D</italic> has either the form &#x021D2;<sub><italic>F</italic></sub><italic>&#x003D5;</italic> (<italic>factual argument</italic>), where <italic>&#x003D5;</italic>&#x02208;<italic>F</italic>, or the form <italic>A</italic><sub>1</sub>, &#x02026;, <italic>A</italic><sub><italic>n</italic></sub>&#x021D2;<sub><italic>r</italic></sub><italic>&#x003D5;</italic> (<italic>plain argument</italic>), where 1 &#x02264; <italic>k</italic> &#x02264; <italic>n</italic>, and</p>
<list list-type="simple">
<list-item><p>- <italic>A</italic><sub><italic>k</italic></sub> is an argument constructed from <italic>D</italic>, and</p></list-item>
<list-item><p>- <italic>r</italic>:<inline-formula><mml:math id="M42"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Conc</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic><sub>1</sub>), &#x02026;,<inline-formula><mml:math id="M43"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Conc</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic><sub><italic>n</italic></sub>)&#x021D2;<italic>&#x003D5;</italic> is a rule in <italic>R</italic>.</p></list-item>
</list>
<p>With regard to a factual argument &#x021D2;<sub><italic>F</italic></sub><italic>&#x003D5;</italic>:</p>
<disp-formula id="E5"><mml:math id="M44"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mstyle mathvariant="sans-serif"><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x003D5;</mml:mi><mml:mo>&#x02205;;</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mstyle mathvariant="sans-serif"><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x02205;;</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mstyle mathvariant="sans-serif"><mml:mi>T</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>R</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x02205;;</mml:mo><mml:mtext>&#x02003;</mml:mtext><mml:mstyle mathvariant="sans-serif"><mml:mi>R</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>With regard to a plain argument <italic>A</italic> &#x0003D; <italic>A</italic><sub>1</sub>, &#x02026;, <italic>A</italic><sub><italic>n</italic></sub>&#x021D2;<sub><italic>r</italic></sub><italic>&#x003D5;</italic>:</p>
<disp-formula id="E6"><mml:math id="M45"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mstyle mathvariant="sans-serif"><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x003D5;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle mathvariant="sans-serif"><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="sans-serif"><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mstyle mathvariant="sans-serif"><mml:mi>S</mml:mi><mml:mi>u</mml:mi><mml:mi>b</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>A</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle mathvariant="sans-serif"><mml:mi>T</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>R</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>r</mml:mi><mml:mo>:</mml:mo><mml:mstyle mathvariant="sans-serif"><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mstyle mathvariant="sans-serif"><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mi>&#x003D5;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle mathvariant="sans-serif"><mml:mi>R</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle mathvariant="sans-serif"><mml:mi>R</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mstyle mathvariant="sans-serif"><mml:mi>R</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mstyle mathvariant="sans-serif"><mml:mi>T</mml:mi><mml:mi>o</mml:mi><mml:mi>p</mml:mi><mml:mi>R</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>We only consider conflicts between arguments <italic>A</italic> and <italic>B</italic> such that the conclusion of <italic>A</italic> contradicts the conclusion of a subargument <italic>B</italic>&#x02032; of <italic>B</italic>.</p>
<p>Conflicts between arguments having contradictory conclusions are resolved on the basis of a last-link ordering. An argument <italic>A</italic> is stronger than another argument <italic>B</italic> (<italic>A</italic>&#x0003E;<italic>B</italic>) if, and only if <inline-formula><mml:math id="M46"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>TopRule</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) is stronger than <inline-formula><mml:math id="M47"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>TopRule</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>B</italic>) [<inline-formula><mml:math id="M48"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>TopRule</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>)&#x0003E;<inline-formula><mml:math id="M49"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>TopRule</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>B</italic>)]. Notice that we do not need to consider conflicts involving arguments of the form &#x021D2;<sub><italic>F</italic></sub><italic>&#x003D5;</italic> since the set of facts is assumed to be consistent and no fact (or its negation) can occur in the head of any rule.<xref ref-type="fn" rid="fn0003"><sup>3</sup></xref></p>
<p>Definition 5 (<bold>Defeats</bold>). An argument <italic>B</italic> <italic>defeats</italic> an argument <italic>A</italic> if, and only if &#x02203;<italic>A</italic>&#x02032;&#x02208;<inline-formula><mml:math id="M50"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Sub</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) such that <inline-formula><mml:math id="M51"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Conc</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>B</italic>) &#x0003D; &#x0007E;<inline-formula><mml:math id="M52"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Conc</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>&#x02032;), and <italic>A</italic>&#x02032;&#x0226F;<italic>B</italic>.</p>
<p>An argument <italic>B</italic> <italic>strictly defeats</italic> an argument <italic>A</italic> if, and only if <italic>B</italic> defeats <italic>A</italic> and <italic>A</italic> does not defeat <italic>B</italic>.</p>
<p>We can now define the argumentation framework that is determined by an argumentation theory.</p>
<p>Definition 6. (<bold>Argumentation framework in structured argumentation</bold>). Let <italic>D</italic> &#x0003D; (<italic>R, F</italic>, &#x0003E;) be an argumentation theory. The <italic>argumentation framework</italic> <inline-formula><mml:math id="M53"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) <italic>determined by</italic> <italic>D</italic> is (<inline-formula><mml:math id="M54"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, &#x0226B;) where <inline-formula><mml:math id="M55"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is the set of all arguments constructible from <italic>D</italic>, and &#x0226B; is the defeat relation defined above.</p>
<p>Given this definition of argumentation framework, if <italic>D</italic> is an argumentation theory, we can abuse notation somewhat and write <italic>GE</italic>(<italic>D</italic>) to denote the grounded extension of the argumentation framework determined by <italic>D</italic>.</p>
<p>As noted above we consider that an argument is justified iff it is included in the grounded extension, and a conclusion justified iff it is supported by a justified argument.</p>
<p>Example 1. Consider the following theory <italic>D</italic>, describing a COVID scenario adapted from Italian temporary legal measures to prevent the spreading of pandemics (Governatori et al., <xref ref-type="bibr" rid="B39">2022a</xref>).<xref ref-type="fn" rid="fn0004"><sup>4</sup></xref></p>
<disp-formula id="E7"><mml:math id="M56"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x0007D;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mi>u</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>r</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>r</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>r</mml:mi><mml:mn>5</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>r</mml:mi><mml:mn>6</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>p</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>r</mml:mi><mml:mn>7</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>r</mml:mi><mml:mn>8</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>p</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi><mml:mo>&#x0007D;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x0003E;</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x0232A;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x0232A;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>5</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>&#x0232A;</mml:mo><mml:mo>&#x0007D;</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Let us define the set <inline-formula><mml:math id="M57"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> of arguments from <italic>D</italic>:</p>
<disp-formula id="E8"><mml:math id="M58"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi mathvariant='script'>A</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mi>F</mml:mi></mml:msub><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mi>F</mml:mi></mml:msub><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mi>F</mml:mi></mml:msub><mml:mo>&#x000AC;</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mi>F</mml:mi></mml:msub><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>5</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>6</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>5</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mo>&#x000AC;</mml:mo><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>7</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>5</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>A</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>8</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>7</mml:mn></mml:msub><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>p</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>9</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:msub><mml:mi>A</mml:mi><mml:mn>8</mml:mn></mml:msub><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mrow><mml:msub><mml:mi>r</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow></mml:msub><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi><mml:mo>&#x0007D;</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The argumentation framework determined by <italic>D</italic> is thus <inline-formula><mml:math id="M59"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) &#x0003D; (<inline-formula><mml:math id="M60"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, &#x0226B;) where</p>
<disp-formula id="E9"><mml:math id="M61"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mo>&#x0226B;</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The grounded extension of <inline-formula><mml:math id="M62"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) is {<italic>A</italic><sub>1</sub>, <italic>A</italic><sub>2</sub>, <italic>A</italic><sub>3</sub>, <italic>A</italic><sub>4</sub>, <italic>A</italic><sub>5</sub>, <italic>A</italic><sub>7</sub>, <italic>A</italic><sub>8</sub>, <italic>A</italic><sub>9</sub>, <italic>A</italic><sub>10</sub>}. The set <italic>GE</italic>(<italic>D</italic>) of justified conclusions is</p>
<disp-formula id="E10"><mml:math id="M63"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>G</mml:mi><mml:mi>E</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>D</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mi>p</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mo>&#x000AC;</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>p</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi><mml:mo>,</mml:mo><mml:mtext>&#x000A0;</mml:mtext><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi><mml:mo>&#x0007D;</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
</sec>
<sec id="s5">
<title>5. Types of explanation in legal argumentation</title>
<p>As informally discussed in Sections 2, 3, an open research issue concerns the relation between the <italic>justification of arguments</italic> and the <italic>explanation of legal conclusions</italic>. To address this issue, we shall try to build a bridge between two research lines using formal argumentation: the AI &#x00026; Law investigation on the justification of (automated) legal decision-making, and the study of the idea of explanation in the context of eXplainable AI. The following sections provide some general ideas to fill the gap and aim at potentially addressing, at an abstract level, the challenges discussed in Sections 2, 3.</p>
<p>In rule-based systems, finding an explanation for a certain normative conclusion <italic>&#x003D5;</italic> (such as a legal conclusion) requires determining if certain pieces of information support the conclusion of <italic>&#x003D5;</italic> through a set of rules (Governatori et al., <xref ref-type="bibr" rid="B40">2022b</xref>). In the context of argumentation, such an intuition should be adjusted and further elaborated. Notice that, in contrast with the majority of the literature (see Section 6) we provide several definitions of the idea of legal explanation that do not simply focus on arguments, but also that make an essential use of the distinctive elements (facts, rules, priorities) of argumentation frameworks.</p>
<p>Our contribution is mainly conceptual and it is meant to show how notions such as those proposed by Miller (<xref ref-type="bibr" rid="B58">2019</xref>) or discussed in legal theory can be modeled in an argumentation framework: an extensive formal study is left to future research.</p>
<sec>
<title>5.1. Explanations by sufficient or necessary arguments</title>
<p>Let us first introduce two auxiliary notions, i.e., closure under subarguments and superarguments.</p>
<p>Definition 7. (<bold>Closure under subarguments and under superarguments</bold>). A set <italic>S</italic> of arguments is closed under subarguments iff for every arguments <italic>A</italic>&#x02208;<italic>S</italic>, <inline-formula><mml:math id="M64"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Sub</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>)&#x02286;<italic>S</italic>.</p>
<p>A set <italic>S</italic> of arguments is closed under superarguments w.r.t. an argument set <italic>W</italic>, iff for every arguments <italic>A</italic>&#x02208;<italic>W</italic> and <italic>A</italic>&#x02032;&#x02208;<italic>S</italic> such that <italic>A</italic>&#x02032;&#x02208;<inline-formula><mml:math id="M65"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Sub</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>), <italic>A</italic>&#x02208;<italic>S</italic>.</p>
<p>Let us begin with two basic concepts of legal explanation that draw inspiration from Hart and Honor&#x000E9;&#x00027;s (<xref ref-type="bibr" rid="B46">1959</xref>) NESS theory of legal causation, and which are reframed here to cover arguments built using norms.</p>
<p>We start with the concept of <italic>explanation by sufficient arguments</italic>, by which we mean a minimal set of arguments which, within the given argumentation framework, is sufficient to determine a certain legal outcome.</p>
<p>Definition 8 (<bold>Explanation by sufficient arguments</bold>). Let <italic>D</italic> &#x0003D; (<italic>R, F</italic>, &#x0003E;) be an argumentation theory and <inline-formula><mml:math id="M66"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) &#x0003D; (<inline-formula><mml:math id="M67"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, &#x0226B;) be the argumentation framework determined by <italic>D</italic>. The set <inline-formula><mml:math id="M68"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x02286;<inline-formula><mml:math id="M69"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is an <italic>explanation of</italic> <italic>&#x003D5;</italic> <italic>by sufficient arguments w.r.t</italic>. <italic>D</italic> iff</p>
<list list-type="simple">
<list-item><p>- <italic>A</italic>&#x02208;<inline-formula><mml:math id="M70"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is an argument for <italic>&#x003D5;</italic> and <italic>A</italic> is justified w.r.t. <italic>D</italic>;</p></list-item>
<list-item><p>- <inline-formula><mml:math id="M71"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is a minimal set such that, for every argument <italic>B</italic>&#x02208;<inline-formula><mml:math id="M72"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> that defeats <italic>A</italic>, there is an argument <italic>C</italic>&#x02208;<inline-formula><mml:math id="M73"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> that strictly defeats <italic>B</italic>;</p></list-item>
<list-item><p>- <inline-formula><mml:math id="M74"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is closed under subarguments.</p></list-item>
</list>
<p>Notice that a broader concept of explanation by sufficient arguments for a conclusion <italic>&#x003D5;</italic> could be obtained by the set-theoretical union of all explanations by sufficiency of <italic>&#x003D5;</italic>.</p>
<p>Remark 1. The idea of explanation by sufficient arguments may be philosophically linked to Hart and Honor&#x000E9;&#x00027;s (<xref ref-type="bibr" rid="B46">1959</xref>) NESS approach to causality, where a cause for an effect is a necessary element of a sufficient set of conditions for that effect. In our framework, any explanation by sufficient arguments <inline-formula><mml:math id="M75"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> of <italic>&#x003D5;</italic> is a sufficient set for <italic>&#x003D5;</italic>.</p>
<p>Within formal argumentation, the idea of an explanation by sufficient arguments has been firstly elaborated with minor differences by Fan and Toni (<xref ref-type="bibr" rid="B33">2015</xref>) with the idea of related admissibility, which states that a set of arguments <inline-formula><mml:math id="M76"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is relatedly admissible iff &#x02203;<italic>A</italic>&#x02208;<inline-formula><mml:math id="M77"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> s.t. <inline-formula><mml:math id="M78"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> defends <italic>A</italic> and <inline-formula><mml:math id="M79"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is admissible. In particular, the authors identify a case where <inline-formula><mml:math id="M80"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is minimal (they call this case <italic>minimal explanation</italic>). A difference with respect to our definition is that we focus on the conclusion <italic>&#x003D5;</italic> (which can be supported by more than one argument) and not on a single argument. A similar analysis has been also proposed by Borg and Bex (<xref ref-type="bibr" rid="B22">2020</xref>).</p>
<p>The second notion of explanation of a proposition is that of <italic>explanation by necessary arguments</italic>. This includes a set of arguments such that their omission from the argumentation framework would prevent the proposition being justified. Note that this notion is independent from the notion of explanation by sufficient arguments, as introduced in Definition 8.</p>
<p>Definition 9 (<bold>Explanation by necessary arguments</bold>). Let <italic>D</italic> &#x0003D; (<italic>R, F</italic>, &#x0003E;) be an argumentation theory and <inline-formula><mml:math id="M81"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) &#x0003D; (<inline-formula><mml:math id="M82"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, &#x0226B;) be the argumentation framework determined by <italic>D</italic>, and <italic>&#x003D5;</italic> be a justified conclusion of <inline-formula><mml:math id="M83"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>). The set <inline-formula><mml:math id="M84"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x02286;<inline-formula><mml:math id="M85"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is an <italic>explanation by necessary arguments</italic> of <italic>&#x003D5;</italic> w.r.t. <inline-formula><mml:math id="M86"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) iff</p>
<list list-type="simple">
<list-item><p>- <italic>&#x003D5;</italic> is not justified w.r.t. <inline-formula><mml:math id="M87"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x02032;(<italic>D</italic>&#x02032;) &#x0003D; (<inline-formula><mml:math id="M88"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>/<italic>S</italic>, &#x0226B;&#x02032;), where <italic>S</italic> is the closure under superarguments of <inline-formula><mml:math id="M89"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> relatively to <inline-formula><mml:math id="M90"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> and &#x0226B;&#x02032; &#x0003D; &#x0226B;&#x02212;{&#x02329;<italic>A, B</italic>&#x0232A;|<italic>A</italic>&#x02208;<italic>S</italic> or <italic>B</italic>&#x02208;<italic>S</italic>};</p></list-item>
<list-item><p>- <inline-formula><mml:math id="M91"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is minimal.</p></list-item>
</list>
<p>Example 2. According to Definition 9, assume that <inline-formula><mml:math id="M92"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) contains argument [[<italic>a</italic>]&#x021D2;<italic>b</italic>]&#x021D2;<italic>c</italic> as well as argument [<italic>d</italic>]&#x021D2;<italic>c</italic>]. Then <italic>c</italic> is explained through necessary arguments by any set including a subargument for each of these arguments. For instance <italic>c</italic> is explained by {[<italic>a</italic>]&#x021D2;<italic>b</italic>], <italic>d</italic>}}, since <italic>c</italic> cannot be established if both [<italic>a</italic>]&#x021D2;<italic>b</italic>] and <italic>d</italic> were not available.</p>
<p>Remark 2. Notice that Borg and Bex (<xref ref-type="bibr" rid="B22">2020</xref>) have also considered the explanation by necessary arguments. In this work, however, the focus <italic>X</italic> is on single arguments and the target (i.e., the <italic>Y</italic> for which <italic>X</italic> is necessary) is an argument and not a legal conclusion <italic>&#x003D5;</italic> (a conclusion can in fact be supported by more arguments). For this reason, the authors do not explicitly state that, when considered more necessary arguments, <italic>S</italic> must be closed under superarguments.</p>
<p>In legal reasoning often the rules are assumed to be fixed and we only consider the facts as relevant explanations. For instance, if asked why one got a fine, a sufficient answer may consist in pointing to the fact that the speed was 100 km per hour, if it is fixed the set of norms containing the rule prohibiting such a speed.</p>
<p>Following this idea, we can provide the following notions of explanations by sufficient and necessary facts, extracting factual arguments from explanations by sufficient and necessary arguments.</p>
<p>Definition 10 (<bold>Explanation by sufficient/necessary facts</bold>). Let D &#x0003D; (<italic>R, F</italic>, &#x0003E;) be an argumentation theory and <inline-formula><mml:math id="M93"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) &#x0003D; (<inline-formula><mml:math id="M94"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, &#x0226B;) be the argumentation framework determined by <italic>D</italic>. The set <inline-formula><mml:math id="M95"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>F</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is an <italic>explanation of</italic> <italic>&#x003D5;</italic> <italic>by sufficient/necessary facts w.r.t</italic>. <italic>D</italic> iff</p>
<list list-type="simple">
<list-item><p>- <inline-formula><mml:math id="M96"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is and explanation by sufficient/necessary arguments of <italic>&#x003D5;</italic> and</p></list-item>
<list-item><p>- <inline-formula><mml:math id="M97"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>F</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is the set of all and only the factual arguments in <inline-formula><mml:math id="M98"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>.</p></list-item>
</list></sec>
<sec>
<title>5.2. Contrastive explanations</title>
<p>Let us now consider some specifications of an idea of explanation that is well-known in the literature (Miller, <xref ref-type="bibr" rid="B58">2019</xref>), which is widely used in XAI (Miller et al., <xref ref-type="bibr" rid="B59">2022</xref>), and which has been recently considered in the context of legal reasoning (Borg and Bex, <xref ref-type="bibr" rid="B22">2020</xref>; Liu et al., <xref ref-type="bibr" rid="B52">2022a</xref>). We may informally characterize such explanations as follows:</p>
<p>Intuition 1 (<bold>Contrastive explanation</bold>). Saying that <italic>&#x003D5;</italic> is contrastively explained by <italic>x</italic>&#x02032; means saying that if <italic>x</italic>&#x02032; rather than <italic>x</italic> had been the case, then <italic>&#x003D5;</italic>&#x02032; rather than <italic>&#x003D5;</italic> would have been the case.</p>
<p>We may develop the intuition above depending on whether we consider facts or rules. Indeed, the idea for modeling such a notion is to remove/add relevant facts or rules in such a way that the justification status of <italic>&#x003D5;</italic> will change, and use these changes to provide (part of) an explanation (see Liu et al., <xref ref-type="bibr" rid="B53">2022b</xref>, following Miller, <xref ref-type="bibr" rid="B58">2019</xref>).</p>
<p>Note that our notion of a constrastive explanation covers two different ways in which the justification of a proposition can be interfered with. The inteference may consist in (a) removing from the theory elements being used in arguments that directly or indirectly support the proposition at stake or (b) inserting in the theory elements to be used in arguments that directly or indirectly attack the proposition at stake. Obviously, indirect support consists in attacking attackers and indirect attack in attacking defenders.</p>
<p>Let us first focus on the facts (the literals) that are being used to build legal arguments. We then consider what arguments would be available if the set of facts were changed, adding and/or removing some facts. Thus the contrastive explanation is obtained by considering a minimal pair &#x02329;<italic>F</italic><sup>&#x02212;</sup>, <italic>F</italic><sup>&#x0002B;</sup>&#x0232A; where <italic>F</italic><sup>&#x02212;</sup> are the facts to be deleted, and <italic>F</italic><sup>&#x0002B;</sup> the facts to be consistently added (i.e., such that <italic>F</italic>&#x0222A;<italic>F</italic><sup>&#x0002B;</sup> is consistent).</p>
<p>Definition 11 (<bold>Fact-based contrastive explanation</bold>). Let <italic>D</italic> = (<italic>R, F</italic>, &#x0003E;) be an argumentation theory and <italic>&#x003D5;</italic> be justified w.r.t. <italic>D</italic>. Then &#x02329;<italic>F</italic><sup>&#x02212;</sup>, <italic>F</italic><sup>&#x0002B;</sup>&#x0232A;, is a <italic>fact-based contrastive explanation of</italic> <italic>&#x003D5;</italic> <italic>w.r.t</italic>. <inline-formula><mml:math id="M99"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) iff</p>
<list list-type="order">
<list-item><p>(<italic>F</italic>\<italic>F</italic><sup>&#x02212;</sup>)&#x0222A;<italic>F</italic><sup>&#x0002B;</sup> is consistent;</p></list-item>
<list-item><p><italic>&#x003D5;</italic> is not justified w.r.t. <italic>D</italic>&#x02032; &#x0003D; (<italic>R</italic>, (<italic>F</italic>\<italic>F</italic><sup>&#x02212;</sup>)&#x0222A;<italic>F</italic><sup>&#x0002B;</sup>), &#x0003E;);</p></list-item>
<list-item><p>no &#x02329;<italic>F</italic><sup>&#x02032;&#x02212;</sup> &#x02286; <italic>F</italic><sup>&#x02212;</sup>, <italic>F</italic><sup>&#x02032;&#x0002B;</sup>&#x02286;<italic>F</italic><sup>&#x0002B;</sup>&#x0232A;, where <italic>F</italic><sup>&#x02032;&#x02212;</sup>&#x0222A;<italic>F</italic><sup>&#x02032;&#x0002B;</sup>&#x02282;<italic>F</italic><sup>&#x0002B;</sup>&#x0222A;<italic>F</italic><sup>&#x02212;</sup>, satisfies conditions 1 and 2.</p></list-item>
</list>
<p>Example 3. Let us apply Definition 11 to Example 1 above. It appears that a fact-based contrastive explanation for <italic>lockdown</italic>_<italic>obligatory</italic> is provided by &#x02329;{<italic>positive</italic>}, &#x02205;&#x0232A;: <italic>positive</italic> contrastively explains that outcome since, without this fact the explanandum would not be justified (if positivity were not the case there would be no obligatory lockdown). Another explanation for the same explanandum would be &#x02329;{<italic>old</italic>}, &#x02205;&#x0232A;.</p>
<p>Similarly, &#x02329;{&#x000AC;<italic>mask</italic>}, {<italic>mask</italic>}&#x0232A; is an explanation for <italic>lockdown</italic>_<italic>obligatory</italic>, since if people had masks rather than not having them, the explanandum would not hold. In fact, under such a change, all the rest remaining the same, we can infer &#x000AC;<italic>spread</italic> so defeating the argument for spread. This would prevent the derivation of <italic>high</italic>_<italic>letality</italic>, <italic>hospital</italic>_<italic>collapse</italic> and <italic>lockdown</italic>_<italic>obligatory</italic>.</p>
<p>Besides contrastively explaining a proposition <italic>&#x003D5;</italic>, as in Definition 11, we may also contrastively explain the non-acceptance of a proposition relative to a theory, i.e., of the failure to provide a justification for it.</p>
<p>Definition 12. (<bold>Fact-based contrastive explanation of non-acceptance</bold>). Let <italic>D</italic> &#x0003D; (<italic>R, F</italic>, &#x0003E;) be an argumentation theory and <italic>&#x003D5;</italic> not be justified w.r.t. <italic>D</italic>. Then &#x02329;<italic>F</italic><sup>&#x02212;</sup>, <italic>F</italic><sup>&#x0002B;</sup>&#x0232A;, is a <italic>fact-based contrastive explanation of the non-acceptance of</italic> <italic>&#x003D5;</italic> <italic>w.r.t</italic>. <inline-formula><mml:math id="M100"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) iff</p>
<list list-type="order">
<list-item><p>(<italic>F</italic>\<italic>F</italic><sup>&#x02212;</sup>)&#x0222A;<italic>F</italic><sup>&#x0002B;</sup> is consistent;</p></list-item>
<list-item><p><italic>&#x003D5;</italic> is justified w.r.t. <italic>D</italic>&#x02032; &#x0003D; (<italic>R</italic>, (<italic>F</italic>\<italic>F</italic><sup>&#x02212;</sup>)&#x0222A;<italic>F</italic><sup>&#x0002B;</sup>), &#x0003E;);</p></list-item>
<list-item><p>no &#x02329;<italic>F</italic><sup>&#x02032;&#x02212;</sup>&#x02286;<italic>F</italic><sup>&#x02212;</sup>, <italic>F</italic><sup>&#x02032;&#x0002B;</sup>&#x02286;<italic>F</italic><sup>&#x0002B;</sup>&#x0232A;, where <italic>F</italic><sup>&#x02032;&#x02212;</sup>&#x0222A;<italic>F</italic><sup>&#x02032;&#x0002B;</sup>&#x02282;<italic>F</italic><sup>&#x0002B;</sup>&#x0222A;<italic>F</italic><sup>&#x02212;</sup>, satisfies conditions 1 and 2.</p></list-item>
</list>
<p>Example 4. Consider again Example 1 add to it the following rule, according which if the pandemic does not spread, we can have a normal life under the pandemic:</p>
<disp-formula id="E11"><mml:math id="M101"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>9</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x000AC;</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi></mml:mstyle><mml:mo>&#x021D2;</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>_</mml:mtext><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>We may than ask &#x0201C;Why is it that we cannot have a normal life,&#x0201D; and an answer would be the contrastive explanation &#x02329;{&#x000AC;<italic>mask</italic>}, {<italic>mask</italic>}&#x0232A;: people are not wearing masks (rather than wearing them). In fact, after the theory is revised by removing, &#x000AC;<italic>mask</italic> and adding <italic>mask</italic>, there is a justified argument for <italic>normal</italic>_<italic>life</italic>, based on rule <italic>r</italic><sub>9</sub>, whose antecedent condition &#x000AC;<italic>spread</italic> can be establishes by using rule <italic>r</italic><sub>3</sub>, and facts <italic>positive</italic>, and <italic>mask</italic>.</p>
<p>The ideas just described can be expanded by assuming that also rules can be removed or added. The rules to be removed are included in the current theory, while the rules to be added can be built from the language (see Definition 2). Thus we obtain the following definition, which matches Definition 11 above.</p>
<p>Definition 13 (<bold>Rule-based contrastive explanation</bold>). Let <italic>D</italic> &#x0003D; (<italic>R, F</italic>, &#x0003E;) be an argumentation theory and <italic>&#x003D5;</italic> be justified w.r.t. <italic>D</italic>. Then &#x02329;<italic>R</italic><sup>&#x02212;</sup>, <italic>R</italic><sup>&#x0002B;</sup>&#x0232A;, with , <italic>R</italic><sup>&#x02212;</sup>&#x02286;<italic>R</italic> and <italic>R</italic><sup>&#x0002B;</sup>&#x02286;Rul, is a <italic>rule-based contrastive explanation of</italic> <italic>&#x003D5;</italic> <italic>w.r.t</italic>. <inline-formula><mml:math id="M102"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) iff</p>
<list list-type="order">
<list-item><p><italic>D</italic>&#x02032; &#x0003D; (<italic>R</italic>\<italic>R</italic><sup>&#x02212;</sup>)&#x0222A;<italic>R</italic><sup>&#x0002B;</sup>, <italic>F</italic>, &#x0003E;&#x02032;) where &#x0003E;&#x02032; &#x0003D; &#x0003E;&#x02212;{&#x02329;<italic>r, r</italic>&#x02032;&#x0232A;|{<italic>r, r</italic>&#x02032;}&#x02229;<italic>R</italic><sup>&#x02212;</sup>&#x02260; };</p></list-item>
<list-item><p><italic>&#x003D5;</italic> is not justified w.r.t. <italic>D</italic>&#x02032;;</p></list-item>
<list-item><p>no &#x02329;<italic>R</italic><sup>&#x02032;&#x02212;</sup>, <italic>R</italic><sup>&#x02032;&#x0002B;</sup>&#x0232A;, such that (<italic>R</italic><sup>&#x02032;&#x02212;</sup>&#x0222A;<italic>R</italic><sup>&#x02032;&#x0002B;</sup>)&#x02282;(<italic>R</italic><sup>&#x02212;</sup>&#x0222A;<italic>R</italic><sup>&#x0002B;</sup>), satisfies conditions 1 and 2.</p></list-item>
</list>
<p>Finally, by combining the possibility to add or remove facts, rules, or even rule-priorities, we come to the following definition:</p>
<p>Definition 14. (<bold>Fact-, rule-, and priority-based contrastive explanation</bold>). Let <italic>D</italic> &#x0003D; (<italic>R, F</italic>, &#x0003E;) be an argumentation theory, <inline-formula><mml:math id="M103"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) &#x0003D; (<inline-formula><mml:math id="M104"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, &#x0226B;) be the argumentation framework determined by <italic>D</italic>, and <italic>&#x003D5;</italic> be justified w.r.t. <italic>D</italic>. Then &#x02329;<italic>F</italic><sup>&#x02212;</sup>, <italic>F</italic><sup>&#x0002B;</sup>&#x0232A;, &#x02329;<italic>R</italic><sup>&#x02212;</sup>, <italic>R</italic><sup>&#x0002B;</sup>&#x0232A;, &#x02329;&#x0003E;<sup>&#x02212;</sup>, &#x0003E;<sup>&#x0002B;</sup>&#x0232A;, with <italic>F</italic><sup>&#x02212;</sup>, <italic>F</italic><sup>&#x0002B;</sup>&#x02286;<inline-formula><mml:math id="M105"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>ANT</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>R</italic>), <italic>R</italic><sup>&#x02212;</sup>, <italic>R</italic><sup>&#x0002B;</sup>&#x02286;Rul, &#x0003E;<sup>&#x02212;</sup>, &#x0003E;<sup>&#x0002B;</sup>&#x02286;Rul &#x000D7; Rul is a <italic>fact-rule-priority-based contrastive explanation of</italic> <italic>&#x003D5;</italic> <italic>w.r.t</italic>. <inline-formula><mml:math id="M106"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) iff</p>
<list list-type="order">
<list-item><p><inline-formula><mml:math id="M107"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>&#x02032;) &#x0003D; (<inline-formula><mml:math id="M108"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, &#x0226B;) is the argumentation framework determined by <italic>D</italic>&#x02032; &#x0003D; (<italic>R</italic>\<italic>R</italic><sup>&#x02212;</sup>)&#x0222A;<italic>R</italic><sup>&#x0002B;</sup>, <italic>F</italic>\<italic>F</italic><sup>&#x02212;</sup>)&#x0222A;<italic>F</italic><sup>&#x0002B;</sup>, (&#x0003E;\&#x0003E;<sup>&#x02212;</sup>)&#x0222A;&#x0003E;<sup>&#x0002B;</sup>))</p></list-item>
<list-item><p><italic>&#x003D5;</italic> is not justified wrt <italic>D</italic>&#x02032;;</p></list-item>
<list-item><p>Conditions 1 and 2. are satisfied by no triplet &#x02329;<italic>F</italic><sup>&#x02032;&#x02212;</sup>, <italic>F</italic><sup>&#x02032;&#x0002B;</sup>&#x0232A;, &#x02329;<italic>R</italic><sup>&#x02032;&#x02212;</sup>, <italic>R</italic><sup>&#x02032;&#x0002B;</sup>&#x0232A;, &#x02329;&#x0003E;<sup>&#x02032;&#x02212;</sup>, &#x0003E;<sup>&#x02032;&#x0002B;</sup>&#x0232A;, such that &#x0222A;(<italic>F</italic><sup>&#x02032;&#x02212;</sup>, <italic>F</italic><sup>&#x02032;&#x0002B;</sup>, <italic>R</italic><sup>&#x02032;&#x02212;</sup>,  <italic>R</italic><sup>&#x02032;&#x0002B;</sup>, &#x0003E;<sup>&#x02032;&#x02212;</sup>, &#x0003E;<sup>&#x02032;&#x0002B;</sup>)&#x02282;&#x0222A;(<italic>F</italic><sup>&#x02212;</sup>, <italic>F</italic><sup>&#x0002B;</sup>, <italic>R</italic><sup>&#x02212;</sup>, <italic>R</italic><sup>&#x0002B;</sup>, &#x0003E;<sup>&#x02212;</sup>, &#x0003E;<sup>&#x0002B;</sup>).</p></list-item>
</list>
<p>The definitions above are abstract and fit the structure of argumentation frameworks: the effective process of defining minimal revisions of rules and priorities is rather complex (see Billington et al., <xref ref-type="bibr" rid="B18">1999</xref>; Governatori and Rotolo, <xref ref-type="bibr" rid="B36">2010</xref>; Boella et al., <xref ref-type="bibr" rid="B19">2016</xref>; Governatori et al., <xref ref-type="bibr" rid="B38">2019</xref>).</p>
<p>Example 5. Consider again Example 1 and the normative conclusion <italic>lockdown</italic>_<italic>obligatory</italic>. Trivially, &#x02329;{<italic>r</italic><sub>2</sub>}, &#x02205;&#x0232A;, &#x02329;{<italic>r</italic><sub>5</sub>}, &#x02205;&#x0232A;, &#x02329;{<italic>r</italic><sub>6</sub>}, &#x0232A;, and &#x02329;{<italic>r</italic><sub>8</sub>}, &#x02205;&#x0232A; are rule-based contrastive explanations of <italic>lockdown</italic>_<italic>obligatory</italic> w.r.t. <inline-formula><mml:math id="M109"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>).</p>
<p>Assume that <italic>F</italic> would already include the fact <italic>countryside</italic> and suppose to change the theory <italic>D</italic> into <italic>D</italic>&#x02032; &#x0003D; (<italic>R</italic>&#x02032;, <italic>F</italic>, &#x0003E;) as follows:</p>
<disp-formula id="E12"><mml:math id="M110"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo></mml:mtd><mml:mtd><mml:mi>R</mml:mi><mml:mo>&#x0222A;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>9</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>s</mml:mi><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi></mml:mstyle><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>n</mml:mi><mml:mtext>_</mml:mtext><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mstyle></mml:mrow><mml:mo>}</mml:mo></mml:mrow><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Then, we would have two new arguments</p>
<disp-formula id="E13"><mml:math id="M111"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:msub><mml:mstyle mathvariant="italic"><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi></mml:mstyle><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mn>9</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mo>&#x000AC;</mml:mo><mml:mstyle mathvariant="italic"><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>n</mml:mi><mml:mtext>_</mml:mtext><mml:mi>o</mml:mi><mml:mi>b</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mstyle></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Since we work in a skeptical semantics, &#x02329;{<italic>r</italic><sub>9</sub>}, &#x02205;&#x0232A; is a rule-based contrastive explanation of <italic>lockdown</italic>_<italic>obligatory</italic> w.r.t. <inline-formula><mml:math id="M112"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>).</p>
<p>Finally, suppose we obtain <italic>D</italic>&#x02032; by simply making &#x0003E; empty: then, &#x02329;&#x02205;,&#x02205;&#x0232A;, &#x02329;&#x02205;,&#x02205;,&#x02329;&#x0003E;<sup>&#x02212;</sup>, &#x02205;&#x0232A; is a fact-rule-priority-based contrastive explanation of <italic>lockdown</italic>_<italic>obligatory</italic> w.r.t. <inline-formula><mml:math id="M113"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>).</p></sec>
<sec>
<title>5.3. Discussion and further examples</title>
<p>Contrastive explanation is perhaps the best example to highlight the third-party nature of explanations as discussed in Section 2. Indeed, such a type of explanation explicitly compares two different argumentation theories and frameworks, which could in fact correspond to two different argumentative angles: one could be attributed to the decision-maker and one of to any observer that rationally reconstructs the decision and explains it by comparison.</p>
<p>More precisely, the actual argumentation framework where we justify a certain legal conclusion provides the perspective of the decision-maker <inline-formula><mml:math id="M114"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>D</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, while the comparison between this framework and anything else is made by a neutral observer <inline-formula><mml:math id="M115"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>O</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>.</p>
<p>Example 6. Let us go back to the case of legal interpretation briefly recalled in Section 3.4 and consider the following provision from the Italian penal code:</p>
<p>Art. 575. Homicide. Whoever causes the death of a <italic>man</italic></p>
<p>[<italic>uomo</italic>] is punishable by no less than 21 years in prison.</p>
<p>The almost unanimous interpretation of courts of art. 575 is that, of course, it covers killing of <italic>any</italic> person and not only of men. For doing so, one may consider the ordinary interpretation of art. 3 of the Italian constitution, which establishes, among other things, that all people have equal social status and are equal before the law, without regard to any personal aspects including gender. This is an argument from general principles. Alternatively, one may use an argument by coherence and maintain that the ordinary interpretation of other legislative provisions <italic>n</italic> does the same. Both exclude the ordinary reading of &#x0201C;man&#x0201D; as &#x0201C;adult male human being.&#x0201D; Consider the following argumentation theory <italic>D</italic>, where &#x003C8; means &#x0201C;only the death of a human male is punishable by no less that 21 years of prison&#x0201D;:</p>
<disp-formula id="E14"><mml:math id="M116"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mn>.3</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x003C0;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x021D2;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mn>.575</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msup><mml:mi>s</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x003B3;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x021D2;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mn>.575</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msup><mml:mi>t</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:mo>&#x021D2;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mn>.575</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo stretchy='false'>)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msup><mml:mi>z</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>&#x0005F;</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mn>.575</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msup><mml:mi>z</mml:mi><mml:mo>&#x02033;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mn>.575</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msup><mml:mi>z</mml:mi><mml:mo>&#x02034;</mml:mo></mml:msup><mml:mo>:</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mn>.575</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x021D2;</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo>&#x0007D;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mn>.3</mml:mn><mml:mo>,</mml:mo><mml:mi>&#x003C0;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo stretchy='false'>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x003B3;</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>&#x0007D;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x0003E;</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mo>&#x02034;</mml:mo></mml:msup><mml:mo>&#x0232A;</mml:mo><mml:mo>&#x0007D;</mml:mo><mml:mo>&#x0007D;</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Suppose a court decides a case rejecting &#x003C8; and supports &#x000AC;&#x003C8; because of <italic>r</italic>&#x02032;, i.e., in the light of art. 3. Indeed, since <inline-formula><mml:math id="M117"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> in <inline-formula><mml:math id="M118"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) includes</p>
<disp-formula id="E15"><mml:math id="M119"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>3</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mi>&#x003C0;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>_</mml:mtext><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>5</mml:mi><mml:mi>7</mml:mi><mml:mi>5</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>then the argument <italic>A</italic><sub>3</sub> and its conclusion &#x000AC;&#x003C8; using <italic>r</italic>&#x02032; and <italic>z</italic>&#x02032; are justified in the corresponding argumentation framework <inline-formula><mml:math id="M120"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>).</p>
<p>Preliminarily, we should note that</p>
<list list-type="simple">
<list-item><p>- {<italic>A</italic><sub>3</sub>, <italic>A</italic><sub>2</sub>, <italic>A</italic><sub>1</sub>} is an explanation by sufficient arguments of &#x000AC;&#x003C8;;</p></list-item>
<list-item><p>- {<italic>A</italic><sub>3</sub>, <italic>A</italic><sub>2</sub>, <italic>A</italic><sub>1</sub>} is not an explanation by necessary arguments of &#x000AC;&#x003C8; if we added the rules</p></list-item>
</list>
<disp-formula id="E16"><mml:math id="M121"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>w</mml:mi><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>5</mml:mi><mml:mi>7</mml:mi><mml:mi>5</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x021D2;</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>5</mml:mi><mml:mi>7</mml:mi><mml:mi>5</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>g</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>5</mml:mi><mml:mi>7</mml:mi><mml:mi>5</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<list list-type="simple">
<list-item><p>and changed the priorities as follows</p></list-item>
</list>
<disp-formula id="E17"><mml:math id="M122"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mo>&#x0003E;</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x02034;</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>&#x02329;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x02034;</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x0232A;</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<list list-type="simple">
<list-item><p>being still {<italic>A</italic><sub>3</sub>, <italic>A</italic><sub>2</sub>, <italic>A</italic><sub>1</sub>} an explanation by sufficiency.</p></list-item>
</list>
<p>This could be enough in the perspective of the decision-maker <inline-formula><mml:math id="M123"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>D</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>. Let us rationally reconstruct <inline-formula><mml:math id="M124"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>D</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x00027;s decision. Such a reconstruction may correspond to an observer <inline-formula><mml:math id="M125"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>O</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>: several options are available. Let us see three of them for the sake of illustration.</p>
<list list-type="order">
<list-item><p>If <inline-formula><mml:math id="M126"><mml:msup><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>3</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mi>&#x003C0;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> then &#x02329;&#x02205;, <italic>F</italic><sup>&#x02212;</sup>&#x0232A; is a fact-based contrastive explanation of &#x003C8;: <inline-formula><mml:math id="M127"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>O</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x00027;s explanation of <inline-formula><mml:math id="M128"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>D</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x00027;s decision in favor of &#x003C8; is based on noticing that this fact, if removed, would prevent the conclusion.</p></list-item>
<list-item><p>Since <inline-formula><mml:math id="M129"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>A</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> in <inline-formula><mml:math id="M130"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>) includes the following set of justified arguments</p></list-item>
</list>
<disp-formula id="E18"><mml:math id="M131"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>3</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mi>&#x003C0;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>_</mml:mtext><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>5</mml:mi><mml:mi>7</mml:mi><mml:mi>5</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:mi>F</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>y</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x003B3;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>I</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:mstyle></mml:mrow></mml:msub><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mstyle mathvariant="italic"><mml:mi>a</mml:mi><mml:mi>r</mml:mi><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>5</mml:mi><mml:mi>7</mml:mi><mml:mi>5</mml:mi></mml:mstyle><mml:mo>,</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mo>&#x021D2;</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x02033;</mml:mo></mml:mrow></mml:msup></mml:mrow></mml:msub><mml:mo>&#x000AC;</mml:mo><mml:mi>&#x003C8;</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<list list-type="simple">
<list-item><p>while <inline-formula><mml:math id="M132"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>D</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> could only explicitly rely on <italic>A</italic><sub>3</sub>, the observer <inline-formula><mml:math id="M133"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>O</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> would contrastively explain the decision by noticing that &#x02329;{<italic>r</italic>&#x02032;, <italic>s</italic>&#x02032;}&#x02205;, &#x0232A; is rule-based contrastive explanation of &#x000AC;&#x003C8;.</p></list-item>
<list-item><p>Finally, assume to change the argumentation theory in such a way that &#x0003E;= &#x02205;. Then <inline-formula><mml:math id="M134"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>D</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> would not decide in favor of &#x000AC;&#x003C8;. Since we work in skeptical argumentation, an observer <inline-formula><mml:math id="M135"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>O</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> can explain this decision by identifying elements that would be needed to conclude &#x000AC;&#x003C8; and by simply noting that</p></list-item>
</list>
<disp-formula id="E19"><mml:math id="M136"><mml:mo>&#x02329;</mml:mo><mml:mo>&#x02205;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x02205;</mml:mo><mml:mo>&#x0232A;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x02329;</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>&#x0007D;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x02205;</mml:mo><mml:mo>&#x0232A;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x02329;</mml:mo><mml:mo>&#x02205;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>z</mml:mi><mml:mrow><mml:mo>&#x00027;</mml:mo><mml:mo>&#x00027;</mml:mo><mml:mo>&#x00027;</mml:mo></mml:mrow></mml:msup><mml:mo>&#x0232A;</mml:mo><mml:mo>&#x0007D;</mml:mo><mml:mo>&#x0232A;</mml:mo></mml:math></disp-formula>
<list list-type="simple">
<list-item><p>is a fact-rule-priority-based contrastive explanation of &#x000AC;&#x003C8;.</p></list-item>
</list></sec>
<sec>
<title>5.4. Stable argumentative explanations</title>
<p>An interesting issue for investigation is the concept of <italic>stable explanation</italic> in argumentation, a concept that was explored from a proof-theoretic perspective, among others, by Brewka et al. (<xref ref-type="bibr" rid="B24">2019</xref>); Brewka and Ulbricht (<xref ref-type="bibr" rid="B25">2019</xref>); Governatori et al. (<xref ref-type="bibr" rid="B40">2022b</xref>). In particular, Governatori et al. (<xref ref-type="bibr" rid="B40">2022b</xref>,<xref ref-type="bibr" rid="B41">c</xref>) considered the problem of determining a stable normative explanation for a certain legal conclusion, which means to identify a set of facts (i.e., reasoning inputs) able to ensure that such a conclusion continues to hold when new facts are added to a normative case. The basic intuition is the following.</p>
<p>Intuition 2 (<bold>Stable explanation</bold>). A normative explanation for a given legal conclusion <italic>&#x003D5;</italic> is stable when adding new normative elements to that explanation does not affect its power to explain <italic>&#x003D5;</italic>.</p>
<p>Interestingly, in the context of legal argumentation, we can observe the following (Governatori et al., <xref ref-type="bibr" rid="B41">2022c</xref>):</p>
<list list-type="simple">
<list-item><p>- Given the facts of the normative case, any judicial proceeding has the objective of determining what <italic>legal requirements</italic> (e.g., obligations, prohibitions, permissions, ascription of rights) hold, and whether such legal requirements have been fulfilled;</p></list-item>
<list-item><p>- If new facts were presented by one party in the proceeding, the outcome of the case could change;</p></list-item>
<list-item><p>- Each party in the judicial proceeding is thus interested in the following question: <italic>How to ensure a specific outcome for a case, which, in an adversarial context, means how to ensure that the facts presented by such a party are &#x0201C;resilient&#x0201D; to the attacks of the opponent</italic>?</p></list-item>
</list>
<p>The following example is adapted from Australian commercial law and from Governatori et al. (<xref ref-type="bibr" rid="B40">2022b</xref>,<xref ref-type="bibr" rid="B41">c</xref>), and illustrates the idea.<xref ref-type="fn" rid="fn0005"><sup>5</sup></xref></p>
<p>Example 7. Suppose the law forbids private individuals engaging in credit activities. However, such activities are permitted if you have a credit license. Moreover, they are also permitted if you are acting on behalf of another person (the principal), who holds a credit license. In any case, such activities are prohibited if you have been banned from them by the competent regulatory authority. Consider the following theory <italic>D</italic>:</p>
<disp-formula id="E20"><mml:math id="M137"><mml:mtable columnalign='left'><mml:mtr><mml:mtd><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x02205;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>c</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>c</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>L</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>s</mml:mi><mml:mi>O</mml:mi><mml:mi>n</mml:mi><mml:mi>B</mml:mi><mml:mi>e</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mi>p</mml:mi><mml:mi>r</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>C</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>L</mml:mi><mml:mi>i</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:mi>c</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;&#x000A0;</mml:mtext><mml:msub><mml:mi>s</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>:</mml:mo><mml:mi>b</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>&#x021D2;</mml:mo><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x0007D;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x0003E;</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x0003E;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x0232A;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>&#x0003E;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x0232A;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>&#x0003E;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x0232A;</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x02329;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>&#x0003E;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>&#x0232A;</mml:mo><mml:mo>&#x0007D;</mml:mo><mml:mo>.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>It is easy to see that relative to theory <italic>D</italic> we can distinguish stable and unstable explanations:</p>
<list list-type="simple">
<list-item><p>- <italic>F</italic>&#x0222A;{<italic>creditActivity</italic>} is not a stable explanation for <italic>violation</italic> w.r.t. <italic>D</italic>, since it is no explanation for <italic>violation</italic> in <italic>D</italic>&#x02032; if facts are {<italic>creditActivity, creditLicense</italic>} (<italic>violation</italic> not being a justified conclusion w.r.t. <italic>D</italic>&#x02032;):</p></list-item>
<list-item><p>- <italic>F</italic>&#x0222A;{<italic>banned, creditActivity</italic>} is stable explanation for <italic>violation</italic> w.r.t. <italic>D</italic>, since there are no facts <italic>F</italic>&#x02032; consistent with <italic>F</italic> (and with the conclusions of the rules in <italic>R</italic>) such that <italic>F</italic> is not an explanation of <italic>violation</italic> with regard to <italic>D</italic>&#x02032;= (<italic>R, F</italic>&#x0222A;<italic>F</italic>&#x02032;, &#x0003E;).</p></list-item>
</list>
<p>Here is a definition of a stable normative explanation, based on the analysis just provided. In the context of stable explanation by sufficient facts we need to consider facts that (a) are additional to the facts in the theory (b) are consistent with the such facts.</p>
<p>Definition 15 (<bold>Stable explanation by sufficient facts</bold>). Let <italic>D</italic> &#x0003D; (<italic>R, F</italic>, &#x0003E;) be an argumentation theory and <inline-formula><mml:math id="M138"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>F</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> be the set of factual arguments of <inline-formula><mml:math id="M139"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>AF</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>D</italic>). An explanation <inline-formula><mml:math id="M140"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x02032;&#x02286;<inline-formula><mml:math id="M141"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>F</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> by sufficient facts is <italic>stable relative to</italic> <italic>D</italic> if there is no set of facts <italic>F</italic>&#x02032; such that</p>
<list list-type="simple">
<list-item><p>- <italic>F</italic>&#x02229;<italic>F</italic>&#x02032;=,</p></list-item>
<list-item><p>- <italic>F</italic>&#x02032; is consistent with <italic>F</italic>, and</p></list-item>
<list-item><p>- <inline-formula><mml:math id="M142"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>&#x02032; is not an explanation by sufficient facts relative to <italic>D</italic>&#x02032; &#x0003D; (<italic>R, F</italic>&#x0222A;<italic>F</italic>&#x02032;, &#x0003E;).</p></list-item>
</list>
<p>It is easy to check that this definition works relative to the examples above. For instance, <inline-formula><mml:math id="M144"><mml:mi>&#x02130;</mml:mi><mml:mo>&#x02032;</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x0007B;</mml:mo><mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mi>F</mml:mi></mml:msub><mml:mi>c</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mo>&#x0007D;</mml:mo></mml:math></inline-formula> is no stable explanation by sufficient facts of <italic>violation</italic>, since adding {<italic>creditLicense</italic>} to the facts is such that there is no explanation of <italic>violation</italic> relative to the facts {<italic>creditActivity, creditLicense</italic>}.</p>
<p>A broader account of Governatori et al. (<xref ref-type="bibr" rid="B40">2022b</xref>)&#x00027;s approach is rule-based and proof-theoretic (in Defeasible Logic: Antoniou et al., <xref ref-type="bibr" rid="B6">2001</xref>) while a deontic extension of it has been developed by Governatori et al. (<xref ref-type="bibr" rid="B41">2022c</xref>) to characterize the idea of deontic explanation. Relative to an argumentation setting such as the one from Section 4, we can establish the following theorem (for the proof, see <xref ref-type="app" rid="A1">Appendix</xref>).</p>
<p>Theorem 1. Given a theory <italic>D</italic> and an explanation by sufficient facts <inline-formula><mml:math id="M145"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>F</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> relative to <italic>D</italic>, the problem of determining if <inline-formula><mml:math id="M177"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>F</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is stable is co-NP-complete.</p></sec></sec>
<sec id="s6">
<title>6. Related and future work</title>
<p>We have provided multiple characterisations for the idea of normative explanation in legal argumentation. We hope that our work, though coherent with previous literature, may contribute to further developments on the interaction between argumentation and explanation in the legal domain. The following lines of inquiry are especially relevant to our endeavor:</p>
<list list-type="simple">
<list-item><p>- Research on explanation in argumentation;</p></list-item>
<list-item><p>- Research on explanation in the AI &#x00026; Law domain;</p></list-item>
<list-item><p>- Research on norm revision and other issues in legal reasoning.</p></list-item>
</list>
<sec>
<title>6.1. Explanation in argumentation</title>
<p>The idea of modeling explanations in an argumentation framework for decision-making is not new (for an overview, see Cyras et al., <xref ref-type="bibr" rid="B28">2021b</xref>). Approaches to argument-based decision-making have been developed, where argumentation is used to evaluate arguments for and against potential decisions, with the argumentation frameworks constituting the explanations (Amgoud and Prade, <xref ref-type="bibr" rid="B5">2009</xref>). Our approach is connected to this idea, though we extract explanations from argumentation frameworks, rather than viewing argumentation framework as explanations.</p>
<p>The goal of providing explanation through argumentation has inspired the research by Toni et al. starting from (Fan and Toni, <xref ref-type="bibr" rid="B33">2015</xref>) [several subsequent contributions appeared and recent developments have been proposed in several applied fields such as medical diagnostics (Cyras et al., <xref ref-type="bibr" rid="B27">2021a</xref>)]. They construct arguments using rules as we do and elaborate the idea of explanation in an argument-based way (also considered in Cyras et al., <xref ref-type="bibr" rid="B28">2021b</xref>). They sees <italic>explanation of an argument</italic> <italic>A</italic> as a relation between <italic>A</italic> and a subset <inline-formula><mml:math id="M178"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> of a set of admissible set of arguments to which <italic>A</italic> belongs. Different appropriateness criteria are adopted to define <inline-formula><mml:math id="M148"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>E</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula>, according to which explanations can be classified into different types: minimal explanation, compact explanation, maximal explanation, and so forth. Differently from them we have focused the need to provide an appropriate <italic>explanation for a legal conclusion</italic>, i.e., and explanation that may be meaningful for the humans involved (relying on Miller, <xref ref-type="bibr" rid="B58">2019</xref>), thus focusing particularly on contrastive explanations. Our work is also related to Borg and Bex (<xref ref-type="bibr" rid="B21">2021a</xref>,<xref ref-type="bibr" rid="B23">b</xref>), who propose similar definitions of explanation by sufficient and necessary arguments, but who do not consider several contrastive models.</p>
<p>Other relevant contributions in decision-making are Liao and van der Torre (<xref ref-type="bibr" rid="B49">2020</xref>) and Besnard et al. (<xref ref-type="bibr" rid="B17">2022</xref>), which however reconstruct explanations within an abstract argumentation perspective.</p></sec>
<sec>
<title>6.2. Explanation in legal argumentation and AI &#x00026; Law</title>
<p>The concept of explanation has played an important role in the AI &#x00026; Law community, being related with the general quest of justification and transparency of legal decision-making (Atkinson et al., <xref ref-type="bibr" rid="B9">2020</xref>). Within this community, argument-based explanations have been considered in the domain of evidence (Walton, <xref ref-type="bibr" rid="B82">2005</xref>; Di Bello and Verheij, <xref ref-type="bibr" rid="B31">2020</xref>), as well as in case-based reasoning (Liu et al., <xref ref-type="bibr" rid="B52">2022a</xref>; Prakken and Ratsma, <xref ref-type="bibr" rid="B65">2022</xref>). Prakken and Ratsma (<xref ref-type="bibr" rid="B65">2022</xref>) reconstruct explanations&#x02014;and in particular contrastive explanations in the context as argument games between a proponent and opponent of an argument (i.e., a case citation for an outcome to be explained). Liu et al. (<xref ref-type="bibr" rid="B52">2022a</xref>) directly follow Miller (<xref ref-type="bibr" rid="B58">2019</xref>) and argue that a case base can be represented through a binary classifier: thus contrastive and counterfactual explanations are used to explain the outcomes of the classifier. Though valuable, those systems work on cases having the form c = (s, X, c), where <italic>s</italic> is a state/fact situation, <italic>c</italic>&#x02208;{0, 1} (the outcome favors the defendant or the plaintiff), and <italic>X</italic>, called the <italic>reason</italic> of the decision, is a subset of <italic>s</italic>. The structure of decisions and legal reasoning is much richer in our framework.</p>
<p>An interesting contribution in legal reasoning&#x02014;but mainly focused on legal evidence&#x02014;is Borg and Bex (<xref ref-type="bibr" rid="B22">2020</xref>), which develops similar notions of explanation by sufficient and necessary arguments. The idea of contrastive is also considered, but the approach is technically rather different. The authors, given the question &#x0201C;why <italic>P</italic> rather than <italic>Q</italic>?&#x0201D;, call <italic>P</italic> the fact and <italic>Q</italic> the foil (Lipton, <xref ref-type="bibr" rid="B51">1990</xref>). The constrative explanation aims at making the foil explicit and considers those arguments that explain: (a) the acceptance of the fact and the non-acceptance of the foil; (b) the non-acceptance of the fact and the acceptance of the foil. Our approach provide several options that exploit the structure of argumentation theories, and which are not discussed by Borg and Bex (<xref ref-type="bibr" rid="B22">2020</xref>) (such as the distinction between factual and plain arguments).</p></sec>
<sec>
<title>6.3. Norm revisions and legal reasoning</title>
<p>As we have shown, the idea of contrastive and stable explanation require the current argumentation framework to be changed. Hence, an interesting issue is rethinking the quest for an explanation as an abductive inference, based on the revision of the given argumentation theory (Governatori and Rotolo, <xref ref-type="bibr" rid="B36">2010</xref>; Governatori et al., <xref ref-type="bibr" rid="B38">2019</xref>). Formally, given the argumentation theory <italic>D</italic><sub><italic>init</italic></sub>, the revised theory <italic>D</italic>, and the target conclusion <italic>&#x003D5;</italic>, we could formally define change operations as follows:</p>
<list list-type="simple">
<list-item><p><bold>Expansion</bold>: from <italic>D</italic><sub><italic>init</italic></sub>&#x022AC;<italic>&#x003D5;</italic> to <italic>D</italic>&#x022A2;<italic>&#x003D5;</italic>.</p></list-item>
<list-item><p><bold>Contraction</bold>: from <italic>D</italic><sub><italic>init</italic></sub>&#x022A2;<italic>&#x003D5;</italic> to <italic>D</italic>&#x022AC;<italic>&#x003D5;</italic>.</p></list-item>
<list-item><p><bold>Revision</bold>: from <italic>D</italic><sub><italic>init</italic></sub>&#x022A2;<italic>&#x003D5;</italic> to <italic>D</italic>&#x022A2;<italic>&#x0007E;<italic>&#x003D5;</italic></italic>.</p></list-item>
</list>
<p>The development of this intuition has to be left to future research.</p>
<p>Another interesting future development concerns the import of the proposed idea of explanation in legal theory. While it is well-known that the idea of explanation can be used to reconstruct causality, it is less clear how to apply it to normative reasons. It can be interesting to mention here an exponent of classical doctrine of case law, Wambaugh (<xref ref-type="bibr" rid="B85">1894</xref>), who stated that the identification of the ratio decidendi of a precedent starting from a particular datum&#x02014;understood as part of the argumentative framework&#x02014;is reduced to a procedure in which one must ask whether, by denying this datum, the court could reach the conclusion obtained. This suggests that various types of explanation can play an interesting role in case-based reasoning (Liu et al., <xref ref-type="bibr" rid="B52">2022a</xref>), including the idea of conterfactual explanation (Miller, <xref ref-type="bibr" rid="B58">2019</xref>), which is left as well to future research.</p></sec></sec>
<sec sec-type="conclusions" id="s7">
<title>7. Conclusion</title>
<p>In this paper we have discussed the role of argumentation in the law, and reviewed some literature of formal models of legal argumentation. Then we have investigated the formal connection between argumentation and explanation in the law. In particular, we have proposed several definitions of an explanation in the context of formal argumentation, articulating the relations between the justification of arguments and explanations.</p>
<p>One basic theoretical challenge was at the core of our contribution: clarifying through formal argumentation the structure in normative reasoning of the concepts of justification and explanation. In legal theory, the focus usually is on providing a justification for legal decisions, so that the idea of an explanation only plays a secondary role. This is due to the fact that on the one hand it is assumed that legal decision-making requires strong standard of (internal) rationality, and on the other hand the notion of an explanation is usually confined to what we called causal explanation, rather than to rational reconstruction.</p>
<p>In this paper we took a different perspective, which is closer to how the concept of explanation has been formally developed in logic and adopted in XAI. We argued that the distinction between justification and explanation is pragmatical rather than structural. Thus we can include rational reconstructions within the scope of explanation, and have argued that such reconstructions can be extracted from justifications, to provide an account of the logic of such justification with regard to the issues at stake. Thus, we have developed various notions of explanation on top of the justification of arguments and conclusions, such as different kinds of contrastive explanations.</p>
<p>We have also presented the idea of stable normative explanation (Governatori et al., <xref ref-type="bibr" rid="B41">2022c</xref>). The problem of determining a stable normative explanation for a certain legal conclusion means to identify a set of facts, obligations, permissions, and other normative inputs able to ensure that such a conclusion continues to hold when new facts are added to a case. This notion is interesting from a logical point of view&#x02014;think about the classical idea of inference to the best explanation&#x02014;but it can contribute to symbolic models for XAI for the law (consider, for instance, systems of predictive justice).</p></sec>
<sec sec-type="data-availability" id="s8">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding authors.</p></sec>
<sec sec-type="author-contributions" id="s9">
<title>Author contributions</title>
<p>All authors contributed to the article and approved the submitted version.</p></sec>
</body>
<back>
<sec sec-type="funding-information" id="s10">
<title>Funding</title>
<p>This project has received funding from the European Research Council (ERC) under the European Union&#x00027;s Horizon 2020 Research and Innovation Programme (grant agreement No. 833647).</p>
</sec>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s11">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<fn-group>
<fn id="fn0001"><p><sup>1</sup>The introduction and parts of Section 3 elaborate on materials from Prakken and Sartor (<xref ref-type="bibr" rid="B67">2015</xref>).</p></fn>
<fn id="fn0002"><p><sup>2</sup>In several systems other two kinds of rules are allowed: strict rules and defeaters. A strict rule is a rule in the classical sense: whenever the antecedent holds, so indisputably is the conclusion. A defeater is a rule that cannot be used to draw any conclusion, but can provide contrary evidence to complementary conclusions.</p></fn>
<fn id="fn0003"><p><sup>3</sup>This simplification does not affect the generality of the approach. Such an assumption, which can be abandoned (see Governatori et al., <xref ref-type="bibr" rid="B37">2004</xref>), allows for exploring some interesting properties of explanations: see Governatori et al. (<xref ref-type="bibr" rid="B40">2022b</xref>) and Section 5.4.</p></fn>
<fn id="fn0004"><p><sup>4</sup><ext-link ext-link-type="uri" xlink:href="https://www.osservatoriosullefonti.it/emergenza-covid-19/fonti-governative/decreti-del-presidente-del-consiglio-dei-ministri/2997-emcov-dpcm-elenco">https://www.osservatoriosullefonti.it/emergenza-covid-19/fonti-governative/decreti-del-presidente-del-consiglio-dei-ministri/2997-emcov-dpcm-elenco</ext-link></p></fn>
<fn id="fn0005"><p><sup>5</sup><ext-link ext-link-type="uri" xlink:href="https://www.legislation.gov.au/Details/C2009A00134">https://www.legislation.gov.au/Details/C2009A00134</ext-link></p></fn>
<fn id="fn0006"><p><sup>6</sup>Notice that we use <italic>&#x003D5;</italic><sub><italic>i</italic></sub> as a variable for a clause in the 3-SAT instance and as a literal (representing the clause) in the corresponding defeasible logic encoding.</p></fn>
<fn id="fn0007"><p><sup>7</sup>More precisely, we have to constructively disprove such a conclusion (i.e., we have to constructively show that there is no proof), something that Defeasible Logic support in its proof theory.</p></fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Achinstein</surname> <given-names>P.</given-names></name></person-group> (<year>1983</year>). <source>The Nature of Explanation</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</citation>
</ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alchourron</surname> <given-names>C.</given-names></name> <name><surname>Bulygin</surname> <given-names>E.</given-names></name></person-group> (<year>1971</year>). <source>Normative Systems. LEP Library of Exact Philosophy</source>. Vienna: Springer. <pub-id pub-id-type="doi">10.1007/978-3-7091-7118-9</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Aleven</surname> <given-names>V.</given-names></name> <name><surname>Ashley</surname> <given-names>K. D.</given-names></name></person-group> (<year>1997</year>). <article-title>&#x0201C;Evaluating a learning environment for case-based argumentation skills,&#x0201D;</article-title> in <source>Proceedings of the Sixth International Conference on Artificial Intelligence and Law (ICAIL-97)</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>170</fpage>&#x02013;<lpage>179</lpage>. <pub-id pub-id-type="doi">10.1145/261618.261650</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Alexy</surname> <given-names>R.</given-names></name></person-group> (<year>1989</year>). <source>A Theory of Legal Argumentation: The Theory of Rational Discourse as Theory of Legal Justification</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Clarendon</publisher-name>.</citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Amgoud</surname> <given-names>L.</given-names></name> <name><surname>Prade</surname> <given-names>H.</given-names></name></person-group> (<year>2009</year>). <article-title>Using arguments for making and explaining decisions</article-title>. <source>Artif. Intell</source>. <volume>173</volume>, <fpage>413</fpage>&#x02013;<lpage>436</lpage>. <pub-id pub-id-type="doi">10.1016/j.artint.2008.11.006</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Antoniou</surname> <given-names>G.</given-names></name> <name><surname>Billington</surname> <given-names>D.</given-names></name> <name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Maher</surname> <given-names>M. J.</given-names></name></person-group> (<year>2001</year>). <article-title>Representation results for defeasible logic</article-title>. <source>ACM Trans. Comput. Log</source>. <volume>2</volume>, <fpage>255</fpage>&#x02013;<lpage>286</lpage>. <pub-id pub-id-type="doi">10.1145/371316.371517</pub-id></citation>
</ref>
<ref id="B7">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ashley</surname> <given-names>K. D.</given-names></name> <name><surname>Aleven</surname> <given-names>V.</given-names></name></person-group> (<year>1991</year>). <article-title>&#x0201C;Toward and intelligent tutoring system for teaching law students to argue with cases,&#x0201D;</article-title> in <source>Proceedings of the Third International Conference on Artificial Intelligence and Law (ICAIL)</source> (<publisher-loc>ACM</publisher-loc>), <fpage>42</fpage>&#x02013;<lpage>52</lpage>. <pub-id pub-id-type="doi">10.1145/112646.112651</pub-id></citation>
</ref>
<ref id="B8">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Ashley</surname> <given-names>K. D.</given-names></name></person-group> (<year>1990</year>). <source>Modeling Legal Argument: Reasoning with Cases and Hypotheticals</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>MIT</publisher-name>.</citation>
</ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Atkinson</surname> <given-names>K.</given-names></name> <name><surname>Bench-Capon</surname> <given-names>T.</given-names></name> <name><surname>Bollegala</surname> <given-names>D.</given-names></name></person-group> (<year>2020</year>). <article-title>Explanation in AI &#x00026; Law: past, present and future</article-title>. <source>Artif. Intell</source>. <volume>289</volume>, <fpage>103387</fpage>. <pub-id pub-id-type="doi">10.1016/j.artint.2020.103387</pub-id></citation>
</ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Atkinson</surname> <given-names>K.</given-names></name> <name><surname>Bench-Capon</surname> <given-names>T. J. M.</given-names></name></person-group> (<year>2007</year>). <article-title>Practical reasoning as presumptive argumentation using action based alternating transition systems</article-title>. <source>Artif. Intell</source>. <volume>171</volume>, <fpage>855</fpage>&#x02013;<lpage>874</lpage>. <pub-id pub-id-type="doi">10.1016/j.artint.2007.04.009</pub-id></citation>
</ref>
<ref id="B11">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Baier</surname> <given-names>K.</given-names></name></person-group> (<year>1958</year>). <source>The Moral Point of View</source>. <publisher-loc>Ithaca, NY</publisher-loc>: <publisher-name>Cornell University Press</publisher-name>.</citation>
</ref>
<ref id="B12">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Baroni</surname> <given-names>P.</given-names></name> <name><surname>Giacomin</surname> <given-names>M.</given-names></name></person-group> (<year>2009</year>). <article-title>&#x0201C;Semantics of abstract argument systems,&#x0201D;</article-title> in <source>Argumentation in Artificial Intelligence</source> (<publisher-loc>Berlin, Heidelberg</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>25</fpage>&#x02013;<lpage>44</lpage>. <pub-id pub-id-type="doi">10.1007/978-0-387-98197-0_2</pub-id></citation>
</ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bench-Capon</surname> <given-names>T. J. M.</given-names></name> <name><surname>Rissland</surname> <given-names>E. L.</given-names></name></person-group> (<year>2002</year>). <article-title>A note on dimensions and factors</article-title>. <source>Artif. Intell. Law</source> <volume>10</volume>, <fpage>65</fpage>&#x02013;<lpage>77</lpage>. <pub-id pub-id-type="doi">10.1023/A:1019501830692</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bench-Capon</surname> <given-names>T. J. M.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2003</year>). <article-title>A model of legal reasoning with cases incorporating theories and values</article-title>. <source>Artif. Intell</source>. <volume>150</volume>, <fpage>97</fpage>&#x02013;<lpage>142</lpage>. <pub-id pub-id-type="doi">10.1016/S0004-3702(03)00108-5</pub-id></citation>
</ref>
<ref id="B15">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Bench-Capon</surname> <given-names>T.</given-names></name> <name><surname>Prakken</surname> <given-names>H.</given-names></name> <name><surname>Wyner</surname> <given-names>A.</given-names></name> <name><surname>Atkinson</surname> <given-names>K.</given-names></name></person-group> (<year>2013</year>). <article-title>&#x0201C;Argument schemes for reasoning with legal cases using values,&#x0201D;</article-title> in <source>Proceedings of the 14th International Conference on Artificial Intelligence and Law</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>13</fpage>&#x02013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.1145/2514601.2514604</pub-id></citation>
</ref>
<ref id="B16">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Berman</surname> <given-names>D. H.</given-names></name> <name><surname>Hafner</surname> <given-names>C. D.</given-names></name></person-group> (<year>1993</year>). <article-title>&#x0201C;Representing teleological structure in case-based reasoning: the missing link,&#x0201D;</article-title> in <source>Proceedings of the Fourth International Conference on Artificial Intelligence and Law (ICAIL)</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>50</fpage>&#x02013;<lpage>59</lpage>. <pub-id pub-id-type="doi">10.1145/158976.158982</pub-id></citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Besnard</surname> <given-names>P.</given-names></name> <name><surname>Doutre</surname> <given-names>S.</given-names></name> <name><surname>Duchatelle</surname> <given-names>T.</given-names></name> <name><surname>Lagasquie-Schiex</surname> <given-names>M.-C.</given-names></name></person-group> (<year>2022</year>). <article-title>Explaining semantics and extension membership in abstract argumentation</article-title>. <source>Intell. Syst. Appl</source>. <volume>16</volume>, <fpage>200118</fpage>. <pub-id pub-id-type="doi">10.1016/j.iswa.2022.200118</pub-id></citation>
</ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Billington</surname> <given-names>D.</given-names></name> <name><surname>Antoniou</surname> <given-names>G.</given-names></name> <name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Maher</surname> <given-names>M.</given-names></name></person-group> (<year>1999</year>). <article-title>Revising nonmonotonic theories: the case of defeasible logic</article-title>. <source>Lect. Notes Comput. Sci</source>. <volume>1701</volume>, <fpage>101</fpage>&#x02013;<lpage>112</lpage>. <pub-id pub-id-type="doi">10.1007/3-540-48238-5_8</pub-id></citation>
</ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Boella</surname> <given-names>G.</given-names></name> <name><surname>Pigozzi</surname> <given-names>G.</given-names></name> <name><surname>van der Torre</surname> <given-names>L.</given-names></name></person-group> (<year>2016</year>). <article-title>Agm contraction and revision of rules</article-title>. <source>J. Log. Lang. Inf</source>. <volume>25</volume>, <fpage>273</fpage>&#x02013;<lpage>297</lpage>. <pub-id pub-id-type="doi">10.1007/s10849-016-9244-9</pub-id></citation>
</ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bongiovanni</surname> <given-names>G.</given-names></name> <name><surname>Postema</surname> <given-names>G.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name> <name><surname>Valentini</surname> <given-names>C.</given-names></name> <name><surname>Walton</surname> <given-names>D.</given-names></name> <etal/></person-group>. (<year>2018</year>). <source>Handbook of Legal Reasoning and Argumentation</source>. Berlin: Springer. <pub-id pub-id-type="doi">10.1007/978-90-481-9452-0</pub-id></citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Borg</surname> <given-names>A.</given-names></name> <name><surname>Bex</surname> <given-names>F.</given-names></name></person-group> (<year>2021a</year>). <article-title>A basic framework for explanations in argumentation</article-title>. <source>IEEE Intell. Syst</source>. <volume>36</volume>, <fpage>25</fpage>&#x02013;<lpage>35</lpage>. <pub-id pub-id-type="doi">10.1109/MIS.2021.3053102</pub-id></citation>
</ref>
<ref id="B22">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Borg</surname> <given-names>A.</given-names></name> <name><surname>Bex</surname> <given-names>F.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;Explaining arguments at the dutch national police,&#x0201D;</article-title> in <source>AI Approaches to the Complexity of Legal Systems XI-XII</source> - <italic>AICOL International Workshops 2018 and 2020: AICOL-XI&#x00040;JURIX 2018, AICOL-XII&#x00040;JURIX 2020, XAILA&#x00040;JURIX 2020, Revised Selected Papers, Volume 13048 of Lecture Notes in Computer Science</italic>, eds <person-group person-group-type="editor"><name><surname>Rodr&#x000ED;guez-Doncel</surname> <given-names>V.</given-names></name> <name><surname>Palmirani</surname> <given-names>M.</given-names></name> <name><surname>Araszkiewicz</surname> <given-names>M.</given-names></name> <name><surname>Casanovas</surname> <given-names>P.</given-names></name> <name><surname>Pagallo</surname> <given-names>U.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<publisher-loc>Berlin</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>183</fpage>&#x02013;<lpage>197</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-89811-3_13</pub-id></citation>
</ref>
<ref id="B23">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Borg</surname> <given-names>A.</given-names></name> <name><surname>Bex</surname> <given-names>F.</given-names></name></person-group> (<year>2021b</year>). <article-title>&#x0201C;Necessary and sufficient explanations for argumentation-based conclusions,&#x0201D;</article-title> in <source>Symbolic and Quantitative Approaches to Reasoning with Uncertainty</source> - <italic>16th European Conference, ECSQARU 2021, Prague, Czech Republic, September 21-24, 2021. Proceedings, volume 12897 of Lecture Notes in Computer Science</italic>, eds <person-group person-group-type="editor"><name><surname>Vejnarov&#x000E1;</surname> <given-names>J.</given-names></name> <name><surname>Wilson</surname> <given-names>N.</given-names></name></person-group> (<publisher-loc>Berlin</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>45</fpage>&#x02013;<lpage>58</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-86772-0_4</pub-id></citation>
</ref>
<ref id="B24">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Brewka</surname> <given-names>G.</given-names></name> <name><surname>Thimm</surname> <given-names>M.</given-names></name> <name><surname>Ulbricht</surname> <given-names>M.</given-names></name></person-group> (<year>2019</year>). <article-title>Strong inconsistency</article-title>. <source>Artif. Intell</source>. <volume>267</volume>, <fpage>78</fpage>&#x02013;<lpage>117</lpage>. <pub-id pub-id-type="doi">10.1016/j.artint.2018.11.002</pub-id></citation>
</ref>
<ref id="B25">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Brewka</surname> <given-names>G.</given-names></name> <name><surname>Ulbricht</surname> <given-names>M.</given-names></name></person-group> (<year>2019</year>). <article-title>&#x0201C;Strong explanations for nonmonotonic reasoning,&#x0201D;</article-title> in <source>Description Logic, Theory Combination, and All That, Volume 11560 of LNCS</source> (<publisher-loc>Berlin</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>135</fpage>&#x02013;<lpage>146</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-22102-7_6</pub-id></citation>
</ref>
<ref id="B26">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Calegari</surname> <given-names>R.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;Burdens of persuasion and standards of proof in structured argumentation,&#x0201D;</article-title> in <source>Logic and Argumentation 4th International Conference, CLAR 2021 Hangzhou, China, October 20-22, 2021. Proceedings</source>, eds <person-group person-group-type="editor"><name><surname>Baroni</surname> <given-names>P.</given-names></name> <name><surname>Benzm&#x000FC;ller</surname> <given-names>C.</given-names></name> <name><surname>W&#x000E1;ng</surname> <given-names>Y. N.</given-names></name></person-group> (<publisher-loc>Berlin</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>40</fpage>&#x02013;<lpage>459</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-89391-0_3</pub-id></citation>
</ref>
<ref id="B27">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cyras</surname> <given-names>K.</given-names></name> <name><surname>Oliveira</surname> <given-names>T.</given-names></name> <name><surname>Karamlou</surname> <given-names>M.</given-names></name> <name><surname>Toni</surname> <given-names>F.</given-names></name></person-group> (<year>2021a</year>). <article-title>Assumption-based argumentation with preferences and goals for patient-centric reasoning with interacting clinical guidelines</article-title>. <source>Argum. Comput</source>. <volume>12</volume>, <fpage>149</fpage>&#x02013;<lpage>189</lpage>. <pub-id pub-id-type="doi">10.3233/AAC-200523</pub-id></citation>
</ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cyras</surname> <given-names>K.</given-names></name> <name><surname>Rago</surname> <given-names>A.</given-names></name> <name><surname>Albini</surname> <given-names>E.</given-names></name> <name><surname>Baroni</surname> <given-names>P.</given-names></name> <name><surname>Toni</surname> <given-names>F.</given-names></name></person-group> (<year>2021b</year>). <article-title>&#x0201C;Argumentative XAI: a survey,&#x0201D;</article-title> in <source>Proc. IJCA I-2021</source>. <pub-id pub-id-type="doi">10.24963/ijcai.2021/600</pub-id></citation>
</ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>da Costa Pereira</surname> <given-names>C.</given-names></name> <name><surname>Liao</surname> <given-names>B.</given-names></name> <name><surname>Malerba</surname> <given-names>A.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Tettamanzi</surname> <given-names>A. G. B.</given-names></name> <name><surname>van der Torre</surname> <given-names>L. W. N.</given-names></name> <etal/></person-group>. (<year>2017</year>). <article-title>Handling norms in multi-agent systems by means of formal argumentation</article-title>. <source>FLAP</source> <volume>4</volume>, <fpage>3039</fpage>&#x02013;<lpage>3073</lpage>.</citation>
</ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Davidson</surname> <given-names>D.</given-names></name></person-group> (<year>1963</year>). <article-title>Actions, reasons, and causes</article-title>. <source>J. Philos</source>. <volume>60</volume>, <fpage>685</fpage>. <pub-id pub-id-type="doi">10.2307/2023177</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Di Bello</surname> <given-names>M.</given-names></name> <name><surname>Verheij</surname> <given-names>B.</given-names></name></person-group> (<year>2020</year>). <article-title>Evidence and decision making in the law: theoretical, computational and empirical approaches</article-title>. <source>Artif. Intell. Law</source> <volume>28</volume>, <fpage>1</fpage>&#x02013;<lpage>5</lpage>. <pub-id pub-id-type="doi">10.1007/s10506-019-09253-0</pub-id><pub-id pub-id-type="pmid">20881228</pub-id></citation></ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dung</surname> <given-names>P. M.</given-names></name></person-group> (<year>1995</year>). <article-title>On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games</article-title>. <source>Artif. Intell</source>. <volume>77</volume>, <fpage>321</fpage>&#x02013;<lpage>358</lpage>. <pub-id pub-id-type="doi">10.1016/0004-3702(94)00041-X</pub-id></citation>
</ref>
<ref id="B33">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Fan</surname> <given-names>X.</given-names></name> <name><surname>Toni</surname> <given-names>F.</given-names></name></person-group> (<year>2015</year>). <article-title>On computing explanations in argumentation</article-title>. <source>Proc. AAAI Conf. Artif. Intell</source>. <volume>29</volume>, <fpage>1496</fpage>&#x02013;<lpage>1502</lpage>. <pub-id pub-id-type="doi">10.1609/aaai.v29i1.9420</pub-id></citation>
</ref>
<ref id="B34">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Gordon</surname> <given-names>T. F.</given-names></name></person-group> (<year>1995</year>). <source>The Pleadings Game. An Artificial Intelligence Model of Procedural Justice</source>. <publisher-loc>Dordrecht</publisher-loc>: <publisher-name>Kluwer</publisher-name>. <pub-id pub-id-type="doi">10.1007/978-94-015-8447-0</pub-id></citation>
</ref>
<ref id="B35">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name></person-group> (<year>2023</year>). <article-title>&#x0201C;Deontic ambiguities in legal reasoning,&#x0201D;</article-title> in <source>ICAIL 2023</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>).</citation>
</ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name></person-group> (<year>2010</year>). <article-title>Changing legal systems: legal abrogations and annulments in defeasible logic</article-title>. <source>Log. J. IGPL</source> <volume>18</volume>, <fpage>157</fpage>&#x02013;<lpage>194</lpage>. <pub-id pub-id-type="doi">10.1093/jigpal/jzp075</pub-id></citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Maher</surname> <given-names>M. J.</given-names></name> <name><surname>Antoniou</surname> <given-names>G.</given-names></name> <name><surname>Billington</surname> <given-names>D.</given-names></name></person-group> (<year>2004</year>). <article-title>Argumentation semantics for defeasible logics</article-title>. <source>J. Log. Comput</source>. <volume>14</volume>, <fpage>675</fpage>&#x02013;<lpage>702</lpage>. <pub-id pub-id-type="doi">10.1093/logcom/14.5.675</pub-id><pub-id pub-id-type="pmid">37275534</pub-id></citation></ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Olivieri</surname> <given-names>F.</given-names></name> <name><surname>Cristani</surname> <given-names>M.</given-names></name> <name><surname>Scannapieco</surname> <given-names>S.</given-names></name></person-group> (<year>2019</year>). <article-title>Revision of defeasible preferences</article-title>. <source>Int. J. Approx. Reason</source> <volume>104</volume>, <fpage>205</fpage>&#x02013;<lpage>230</lpage>. <pub-id pub-id-type="doi">10.1016/j.ijar.2018.10.020</pub-id><pub-id pub-id-type="pmid">23082030</pub-id></citation></ref>
<ref id="B39">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Olivieri</surname> <given-names>F.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Cristani</surname> <given-names>M.</given-names></name></person-group> (<year>2022a</year>). <article-title>&#x0201C;From defeasible logic to counterfactual reasoning,&#x0201D;</article-title> in <source>Proc. Declarative AI 2022</source> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>).</citation>
</ref>
<ref id="B40">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Olivieri</surname> <given-names>F.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Cristani</surname> <given-names>M.</given-names></name></person-group> (<year>2022b</year>). <article-title>&#x0201C;Inference to the stable explanations,&#x0201D;</article-title> in <source>LPNMR 2022</source> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>245</fpage>&#x02013;<lpage>258</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-031-15707-3_19</pub-id></citation>
</ref>
<ref id="B41">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Olivieri</surname> <given-names>F.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Cristani</surname> <given-names>M.</given-names></name></person-group> (<year>2022c</year>). <article-title>&#x0201C;Stable normative explanations,&#x0201D;</article-title> in <source>Legal Knowledge and Information Systems - JURIX 2022: The Thirty-fifth Annual Conference, Saarbr&#x000FC;cken, Germany, 14-16 December 2022, volume 362 of Frontiers in Artificial Intelligence and Applications</source>, eds <person-group person-group-type="editor"><name><surname>Francesconi</surname> <given-names>E.</given-names></name> <name><surname>Borges</surname> <given-names>G.</given-names></name> <name><surname>Sorge</surname> <given-names>C.</given-names></name></person-group> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>IOS Press</publisher-name>), <fpage>43</fpage>&#x02013;<lpage>52</lpage>. <pub-id pub-id-type="doi">10.3233/FAIA220447</pub-id></citation>
</ref>
<ref id="B42">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Olivieri</surname> <given-names>F.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Scannapieco</surname> <given-names>S.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2014</year>). <article-title>&#x0201C;Two faces of strategic argumentation in the law,&#x0201D;</article-title> in <source>JURIX-2014</source> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>IOS</publisher-name>), <fpage>81</fpage>&#x02013;<lpage>90</lpage>.</citation>
</ref>
<ref id="B43">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;Logic and the law: philosophical foundations, deontics, and defeasible reasoning,&#x0201D;</article-title> in <source>Handbook of Deontic Logic and Normative Systems</source>, Volume 2, eds <person-group person-group-type="editor"><name><surname>Gabbay</surname> <given-names>D.</given-names></name> <name><surname>Horty</surname> <given-names>J.</given-names></name> <name><surname>Parent</surname> <given-names>X.</given-names></name></person-group> (<publisher-loc>London</publisher-loc>: <publisher-name>College Publications</publisher-name>), <fpage>657</fpage>&#x02013;<lpage>764</lpage>.</citation>
</ref>
<ref id="B44">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Hage</surname> <given-names>J. C.</given-names></name></person-group> (<year>1997</year>). <source>Reasoning with Rules: An Essay on Legal Reasoning and Its Underlying Logic</source>. <publisher-loc>Dordrecht</publisher-loc>: <publisher-name>Kluwer</publisher-name>. <pub-id pub-id-type="doi">10.1007/978-94-015-8873-7</pub-id></citation>
</ref>
<ref id="B45">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Hart</surname> <given-names>H. L. A.</given-names></name></person-group> (<year>1994</year>). <source>The Concept of Law</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Clarendon Press</publisher-name>.</citation>
</ref>
<ref id="B46">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Hart</surname> <given-names>H. L. A.</given-names></name> <name><surname>Honor&#x000E9;</surname> <given-names>T.</given-names></name></person-group> (<year>1959</year>). <source>Causation in Law</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Clarendon</publisher-name>.</citation>
</ref>
<ref id="B47">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Horty</surname> <given-names>J. F.</given-names></name></person-group> (<year>2011</year>). <article-title>Rules and reasons in the theory of precedent</article-title>. <source>Legal Theory</source> <volume>10</volume>, <fpage>1</fpage>&#x02013;<lpage>33</lpage>. <pub-id pub-id-type="doi">10.1017/S1352325211000036</pub-id></citation>
</ref>
<ref id="B48">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Kampik</surname> <given-names>T.</given-names></name> <name><surname>Gabbay</surname> <given-names>D.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;The burden of persuasion in abstract argumentation,&#x0201D;</article-title> in <source>Clar-01</source> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>). <pub-id pub-id-type="doi">10.1007/978-3-030-89391-0_13</pub-id></citation>
</ref>
<ref id="B49">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Liao</surname> <given-names>B.</given-names></name> <name><surname>van der Torre</surname> <given-names>L.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;Explanation semantics for abstract argumentation,&#x0201D;</article-title> in <source>Computational Models of Argument - Proceedings of COMMA 2020, Perugia, Italy, September 4-11, 2020, volume 326 of Frontiers in Artificial Intelligence and Applications</source>, eds <person-group person-group-type="editor"><name><surname>Prakken</surname> <given-names>H.</given-names></name> <name><surname>Bistarelli</surname> <given-names>S.</given-names></name> <name><surname>Santini</surname> <given-names>F.</given-names></name> <name><surname>Taticchi</surname> <given-names>C.</given-names></name></person-group> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>IOS Press</publisher-name>), <fpage>271</fpage>&#x02013;<lpage>282</lpage>.</citation>
</ref>
<ref id="B50">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Liepina</surname> <given-names>R.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name> <name><surname>Wyner</surname> <given-names>A.</given-names></name></person-group> (<year>2020</year>). <article-title>Arguing about causes in law: a semi-formal framework for causal arguments</article-title>. <source>Artif. Intell. Law</source> <volume>28</volume>, <fpage>69</fpage>&#x02013;<lpage>89</lpage>. <pub-id pub-id-type="doi">10.1007/s10506-019-09246-z</pub-id></citation>
</ref>
<ref id="B51">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lipton</surname> <given-names>P.</given-names></name></person-group> (<year>1990</year>). <article-title>Contrastive explanation</article-title>. <source>R. Inst. Philos. Suppl</source>. <volume>27</volume>, <fpage>247</fpage>&#x02013;<lpage>266</lpage>. <pub-id pub-id-type="doi">10.1017/S1358246100005130</pub-id></citation>
</ref>
<ref id="B52">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>X.</given-names></name> <name><surname>Lorini</surname> <given-names>E.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2022a</year>). <article-title>&#x0201C;Modelling and explaining legal case-based reasoners through classifiers,&#x0201D;</article-title> in <source>Legal Knowledge and Information Systems - JURIX 2022: The Thirty-fifth Annual Conference, Saarbr&#x000FC;cken, Germany, 14-16 December 2022, Volume 362 of Frontiers in Artificial Intelligence and Applications</source>, eds <person-group person-group-type="editor"><name><surname>Francesconi</surname> <given-names>E.</given-names></name> <name><surname>Borges</surname> <given-names>G.</given-names></name> <name><surname>Sorge</surname> <given-names>C.</given-names></name></person-group> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>IOS Press</publisher-name>), <fpage>83</fpage>&#x02013;<lpage>92</lpage>. <pub-id pub-id-type="doi">10.3233/FAIA220451</pub-id></citation>
</ref>
<ref id="B53">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Liu</surname> <given-names>X.</given-names></name> <name><surname>Lorini</surname> <given-names>E.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2022b</year>). <article-title>&#x0201C;Modelling and explaining legal case-based reasoners through classifiers,&#x0201D;</article-title> in <source>Proc. JURIX 2022</source> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>IOS Press</publisher-name>).</citation>
</ref>
<ref id="B54">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>MacCormick</surname> <given-names>D. N.</given-names></name></person-group> (<year>1978</year>). <source>Legal Reasoning and Legal Theory</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Clarendon</publisher-name>.</citation>
</ref>
<ref id="B55">
<citation citation-type="book"><person-group person-group-type="editor"><name><surname>MacCormick</surname> <given-names>D. N.</given-names></name> <name><surname>Summers</surname> <given-names>R. S. (eds)</given-names></name></person-group> (<year>1991</year>). <source>Interpreting Statutes: A Comparative Study</source>. <publisher-loc>Hanover, NH</publisher-loc>: <publisher-name>Darthmouth</publisher-name>.</citation>
</ref>
<ref id="B56">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Maher</surname> <given-names>M. J.</given-names></name></person-group> (<year>2001</year>). <article-title>Propositional defeasible logic has linear complexity</article-title>. <source>Theory Pract. Log. Program</source>. <volume>1</volume>, <fpage>691</fpage>&#x02013;<lpage>711</lpage>. <pub-id pub-id-type="doi">10.1017/S1471068401001168</pub-id></citation>
</ref>
<ref id="B57">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Maranh&#x000E3;o</surname> <given-names>J.</given-names></name> <name><surname>de Souza</surname> <given-names>E. G.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;A dynamic model for balancing values,&#x0201D;</article-title> in <source>ICAIL &#x00027;21: Eighteenth International Conference for Artificial Intelligence and Law, S&#x000E3;o Paulo Brazil, June 21&#x02013;25, 2021</source>, eds J. Maranh&#x000E3;o, and A. Z. Wyner (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>89</fpage>&#x02013;<lpage>98</lpage>.</citation>
</ref>
<ref id="B58">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Miller</surname> <given-names>T.</given-names></name></person-group> (<year>2019</year>). <article-title>Explanation in artificial intelligence: insights from the social sciences</article-title>. <source>Artif. Intell</source>. <volume>267</volume>, <fpage>1</fpage>&#x02013;<lpage>38</lpage>. <pub-id pub-id-type="doi">10.1016/j.artint.2018.07.007</pub-id></citation>
</ref>
<ref id="B59">
<citation citation-type="book"><person-group person-group-type="editor"><name><surname>Miller</surname> <given-names>T.</given-names></name> <name><surname>Hoffman</surname> <given-names>R.</given-names></name> <name><surname>Amir</surname> <given-names>O.</given-names></name> <name><surname>Holzinger</surname> <given-names>A.</given-names></name></person-group> (eds) (<year>2022</year>). <source>Artificial Intelligence Journal: Special Issue on Explainable Artificial Intelligence (XAI), Volume 307</source>. <pub-id pub-id-type="doi">10.1016/j.artint.2022.103705</pub-id></citation>
</ref>
<ref id="B60">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Peczenik</surname> <given-names>A.</given-names></name></person-group> (<year>1989</year>). <source>On Law and Reason</source>. <publisher-loc>Dordrecht</publisher-loc>: <publisher-name>Kluwer</publisher-name>. <pub-id pub-id-type="doi">10.1007/978-1-4020-8381-5</pub-id></citation>
</ref>
<ref id="B61">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Perelman</surname> <given-names>C.</given-names></name> <name><surname>Olbrechts-Tyteca</surname> <given-names>L.</given-names></name></person-group> (<year>1969</year>). <source>The New Rhetoric: A Treatise on Argumentation</source>. <publisher-loc>South Bend, IN</publisher-loc>: <publisher-name>University of Notre Dame Press</publisher-name>.</citation>
</ref>
<ref id="B62">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Pitt</surname> <given-names>J. C.</given-names></name></person-group> (<year>1988</year>). <source>Theories of Explanation</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>.</citation>
</ref>
<ref id="B63">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Pollock</surname> <given-names>J. L.</given-names></name></person-group> (<year>1995</year>). <source>Cognitive Carpentry: A Blueprint for How to Build a Person</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>MIT</publisher-name>. <pub-id pub-id-type="doi">10.7551/mitpress/1887.001.0001</pub-id></citation>
</ref>
<ref id="B64">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prakken</surname> <given-names>H.</given-names></name></person-group> (<year>2010</year>). <article-title>An abstract framework for argumentation with structured arguments</article-title>. <source>Argum. Comput</source>. <volume>1</volume>, <fpage>93</fpage>&#x02013;<lpage>124</lpage>. <pub-id pub-id-type="doi">10.1080/19462160903564592</pub-id><pub-id pub-id-type="pmid">30873711</pub-id></citation></ref>
<ref id="B65">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prakken</surname> <given-names>H.</given-names></name> <name><surname>Ratsma</surname> <given-names>R.</given-names></name></person-group> (<year>2022</year>). <article-title>A top-level model of case-based argumentation for explanation: formalisation and experiments</article-title>. <source>Argum. Comput</source>. <volume>13</volume>, <fpage>159</fpage>&#x02013;<lpage>194</lpage>. <pub-id pub-id-type="doi">10.3233/AAC-210009</pub-id></citation>
</ref>
<ref id="B66">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prakken</surname> <given-names>H.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>1998</year>). <article-title>Modelling reasoning with precedents in a formal dialogue game</article-title>. <source>Artif. Intell. Law</source> <volume>6</volume>, <fpage>231</fpage>&#x02013;<lpage>287</lpage>. <pub-id pub-id-type="doi">10.1023/A:1008278309945</pub-id></citation>
</ref>
<ref id="B67">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Prakken</surname> <given-names>H.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2015</year>). <article-title>Law and logic: a review from an argumentation perspective</article-title>. <source>Artif. Intell</source>. <volume>227</volume>, <fpage>214</fpage>&#x02013;<lpage>245</lpage>. <pub-id pub-id-type="doi">10.1016/j.artint.2015.06.005</pub-id></citation>
</ref>
<ref id="B68">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Prakken</surname> <given-names>H.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2023</year>). <article-title>&#x0201C;A formal framework for combining legal reasoning methods,&#x0201D;</article-title> in <source>ICAIL 2023</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>).</citation>
</ref>
<ref id="B69">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Prakken</surname> <given-names>H.</given-names></name> <name><surname>Vreeswijk</surname> <given-names>G.</given-names></name></person-group> (<year>2002</year>). &#x0201C;Logics for defeasible argumentation,&#x0201D; <italic>Handbook of Philosophical Logic</italic>, Volume 4, eds D. M. Gabbay, and F. Guenthner (<publisher-loc>Dordrecht</publisher-loc>: <publisher-name>Kluwer</publisher-name>), <fpage>218</fpage>&#x02013;<lpage>319</lpage>.</citation>
</ref>
<ref id="B70">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Prakken</surname> <given-names>H.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2006</year>). <article-title>&#x0201C;Presumptions and burdens of proof,&#x0201D;</article-title> in <source>Proceedings of the Nineteenth Annual Conference on Legal Knowledge and Information Systems (JURIX)</source>, ed <person-group person-group-type="editor"><name><surname>Van Engers</surname> <given-names>T.</given-names></name></person-group> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>IOS</publisher-name>), <fpage>176</fpage>&#x02013;<lpage>185</lpage>. <pub-id pub-id-type="doi">10.2139/ssrn.963761</pub-id></citation>
</ref>
<ref id="B71">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Rissland</surname> <given-names>E. L.</given-names></name> <name><surname>Ashley</surname> <given-names>K. D.</given-names></name></person-group> (<year>1987</year>). <article-title>&#x0201C;A case-based system for trade secrets law,&#x0201D;</article-title> in <source>Proceedings of the First International Conference on Artificial Intelligence and Law (ICAIL)</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>60</fpage>&#x02013;<lpage>66</lpage>. <pub-id pub-id-type="doi">10.1145/41735.41743</pub-id></citation>
</ref>
<ref id="B72">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Riveret</surname> <given-names>R.</given-names></name> <name><surname>Prakken</surname> <given-names>H.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2008</year>). <article-title>&#x0201C;Heuristics in argumentation: a game-theoretical investigation,&#x0201D;</article-title> in <source>Computational Models of Argument. Proceedings of COMMA-08</source> (<publisher-loc>Amsterdam</publisher-loc>: <publisher-name>IOS</publisher-name>), <fpage>324</fpage>&#x02013;<lpage>335</lpage>.</citation>
</ref>
<ref id="B73">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Roth</surname> <given-names>B.</given-names></name> <name><surname>Riveret</surname> <given-names>R.</given-names></name> <name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Governatori</surname> <given-names>G.</given-names></name></person-group> (<year>2007</year>). <article-title>&#x0201C;Strategic argumentation: a game theoretical investigation,&#x0201D;</article-title> in <source>Proceedings of the Eleventh International Conference on Artificial Intelligence and Law</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>81</fpage>&#x02013;<lpage>90</lpage>. <pub-id pub-id-type="doi">10.1145/1276318.1276333</pub-id></citation>
</ref>
<ref id="B74">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Rotolo</surname> <given-names>A.</given-names></name> <name><surname>Governatori</surname> <given-names>G.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2015</year>). <article-title>&#x0201C;Deontic defeasible reasoning in legal interpretation: two options for modelling interpretive arguments,&#x0201D;</article-title> in <source>Proceedings of the 15th International Conference on Artificial Intelligence and Law (ICAIL&#x00027;05)</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>99</fpage>&#x02013;<lpage>108</lpage>. <pub-id pub-id-type="doi">10.1145/2746090.2746100</pub-id></citation>
</ref>
<ref id="B75">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2005</year>). <source>Legal Reasoning: A Cognitive Approach to the Law</source>. <publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>.</citation>
</ref>
<ref id="B76">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2023</year>). <source>Interpretation, Argumentation, and the Determinacy of Law</source>. <publisher-loc>San Francisco, CA</publisher-loc>: <publisher-name>Ratio Juris</publisher-name>. <pub-id pub-id-type="doi">10.1111/raju.12389</pub-id></citation>
</ref>
<ref id="B77">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schroeder</surname> <given-names>M.</given-names></name></person-group> (<year>2005</year>). <article-title>Cudworth and normative explanations</article-title>. <source>J. Ethics Soc. Philos</source>. <volume>1</volume>, <fpage>1</fpage>&#x02013;<lpage>28</lpage>. <pub-id pub-id-type="doi">10.26556/jesp.v1i3.15</pub-id></citation>
</ref>
<ref id="B78">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Toni</surname> <given-names>F.</given-names></name></person-group> (<year>2013</year>). <article-title>A generalised framework for dispute derivations in assumption-based argumentation</article-title>. <source>Artif. Intell</source>. <volume>195</volume>, <fpage>1</fpage>&#x02013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.1016/j.artint.2012.09.010</pub-id></citation>
</ref>
<ref id="B79">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>V&#x000E4;yrynen</surname> <given-names>P.</given-names></name></person-group> (<year>2021</year>). <article-title>Normative explanation and justification</article-title>. <source>No&#x000FB;s</source> <volume>55</volume>, <fpage>3</fpage>&#x02013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.1111/nous.12283</pub-id></citation>
</ref>
<ref id="B80">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Verheij</surname> <given-names>B.</given-names></name> <name><surname>Bex</surname> <given-names>F.</given-names></name> <name><surname>Timmer</surname> <given-names>S.</given-names></name> <name><surname>Vlek</surname> <given-names>C.</given-names></name> <name><surname>Meyer</surname> <given-names>J.-J.</given-names></name> <name><surname>Renooij</surname> <given-names>S.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Arguments, scenarios and probabilities: connections between three normative frameworks for evidential reasoning</article-title>. <source>Law Probab. Risk</source>. <volume>15</volume>, <fpage>35</fpage>&#x02013;<lpage>70</lpage>. <pub-id pub-id-type="doi">10.1093/lpr/mgv013</pub-id></citation>
</ref>
<ref id="B81">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Walton</surname> <given-names>D.</given-names></name></person-group> (<year>2002</year>). <source>Legal Argumentation and Evidence. Legal Argumentation and Evidence</source>. <publisher-loc>University Park, PA</publisher-loc>: <publisher-name>Pennsylvania State University Press</publisher-name>. <pub-id pub-id-type="doi">10.1023/A:1021108016075</pub-id></citation>
</ref>
<ref id="B82">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Walton</surname> <given-names>D.</given-names></name></person-group> (<year>2005</year>). <source>Dialectical Explanation in AI</source>. <publisher-loc>Berlin, Heidelberg</publisher-loc>: <publisher-name>Springer Berlin Heidelberg</publisher-name>, <fpage>173</fpage>&#x02013;<lpage>212</lpage>.</citation>
</ref>
<ref id="B83">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Walton</surname> <given-names>D.</given-names></name> <name><surname>Macagno</surname> <given-names>F.</given-names></name> <name><surname>Sartor</surname> <given-names>G.</given-names></name></person-group> (<year>2021</year>). <source>Statutory Interpretation. Pragmatics and Argumentation</source>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>. <pub-id pub-id-type="doi">10.1017/9781108554572</pub-id></citation>
</ref>
<ref id="B84">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Walton</surname> <given-names>D. N.</given-names></name> <name><surname>Reed</surname> <given-names>C.</given-names></name> <name><surname>Macagno</surname> <given-names>F.</given-names></name></person-group> (<year>2008</year>). <source>Argumentation Schemes</source>. <publisher-loc>Cambridge</publisher-loc>: <publisher-name>Cambridge University Press</publisher-name>. <pub-id pub-id-type="doi">10.1017/CBO9780511802034</pub-id></citation>
</ref>
<ref id="B85">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Wambaugh</surname> <given-names>E.</given-names></name></person-group> (<year>1894</year>). <source>The Case Study</source>. <publisher-loc>Boston, MA</publisher-loc>: <publisher-name>Little Brown and Co</publisher-name>.</citation>
</ref>
</ref-list>
<app-group>
<app id="A1">
<title>Appendix: proof of Theorem 1</title>
<p>Proof.Rule-based grounded semantics are characterized by Defeasible Logic with ambiguity propagation (<italic>DL<sub>p</sub></italic>) (Antoniou et al., <xref ref-type="bibr" rid="B6">2001</xref>), and so we know that, given any argumentation theory <italic>D</italic> and for any conclusion &#x003C8;, <italic>D</italic>&#x022A2;<italic>DL<sub>p</sub></italic>&#x003C8; (resp. <italic>D</italic>&#x022AC;<italic>DL<sub>p</sub></italic>&#x003C8;) iff there exists an argument <italic>A</italic> in <italic>GE</italic>(<italic>D</italic>) such that <inline-formula><mml:math id="M149"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Conc</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) &#x0003D; &#x003C8; (resp. there exists no argument <italic>A</italic> in <italic>GE</italic>(<italic>D</italic>) such that <inline-formula><mml:math id="M150"><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>Conc</mml:mi></mml:mstyle></mml:mrow></mml:math></inline-formula>(<italic>A</italic>) &#x0003D; &#x003C8;) under grounded semantics (Governatori et al., <xref ref-type="bibr" rid="B37">2004</xref>, Theorem 3.12). Accordingly, we can resort, with some minor modifications, to the proof developed by Governatori et al. (<xref ref-type="bibr" rid="B40">2022b</xref>) and which is based on the proof-theoretic properties of Defeasible Logic. We show that the complement of the considered problem is NP-complete. Namely, given the argumentation theory and the normative case, the problem is to show that the case is not stable. Hence, we have to show that a superset of the explanation that does not prove the target literal exists using the proof theory described by Governatori et al. (<xref ref-type="bibr" rid="B37">2004</xref>). As usual, the proof consists of two parts. Given an oracle that guesses a theory where the set of facts is a superset of the one corresponding to the explanation, we can check polynomially whether this theory proves the target literal or not [which is a standard result of Defeasible Logics (Maher, <xref ref-type="bibr" rid="B56">2001</xref>)]. For the second part, we provide a polynomial encoding of 3-SAT, and we demonstrate that if the theory encoding the 3-SAT instance is not stable, then the 3-SAT instance is satisfiable. A 3-SAT instance is given by</p>
<disp-formula id="E21"><mml:math id="M151"><mml:mrow><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02227;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M152"><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x02228;</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x02228;</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula>. Its encoding in Defeasible Logic is given by the argumentation theory <italic>D</italic> &#x0003D; (<italic>R</italic>, &#x02205;, &#x02205;) where <italic>R</italic> contains, for every clause <italic>&#x003D5;</italic><sub><italic>i</italic></sub>, the following rules<xref ref-type="fn" rid="fn0006"><sup>6</sup></xref>:</p>
<disp-formula id="E22"><mml:math id="M153"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x021D2;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x02003;&#x000A0;</mml:mtext><mml:mi>j</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>plus the two rules:</p>
<disp-formula id="E23"><mml:math id="M154"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x021D2;</mml:mo><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>:</mml:mo><mml:mo>&#x021D2;</mml:mo><mml:mo>&#x000AC;</mml:mo><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>The encoding is polynomial in the size of the 3-SAT instance. We consider the case given by the empty set of facts and &#x000AC;<italic>sat</italic> as the target literal. It is immediate to verify that <italic>D</italic>&#x022A2;<italic>DL<sub>p</sub></italic>&#x000AC;<italic>sat</italic>: <italic>r</italic><sub><italic>nsat</italic></sub> is the only applicable rule. The set of admissible facts (see Definition 3) consists of all literals <inline-formula><mml:math id="M155"><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M156"><mml:mo>&#x000AC;</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. To show that  is not stable we have to find a subset of admissible facts <italic>C</italic> such that <inline-formula><mml:math id="M157"><mml:msup><mml:mi>D</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:mo>=</mml:mo><mml:mo stretchy='false'>(</mml:mo><mml:mi>R</mml:mi><mml:mo>,</mml:mo><mml:mi>C</mml:mi><mml:mo>,</mml:mo><mml:mo>&#x02205;</mml:mo><mml:mo stretchy='false'>)</mml:mo><mml:msub><mml:menclose notation='updiagonalstrike'><mml:mo>&#x022A2;</mml:mo></mml:menclose><mml:mrow><mml:mi>D</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>&#x000AC;</mml:mo><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:math></inline-formula>.<xref ref-type="fn" rid="fn0007"><sup>7</sup></xref> For a (consistent) set of admissible facts <italic>C</italic>, we build the interpretation <italic>I</italic> as follows:</p>
<disp-formula id="E24"><mml:math id="M158"><mml:mi>I</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>&#x003C8;</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>T</mml:mi><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:msubsup><mml:mi>&#x003C8;</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>&#x02208;</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mi>F</mml:mi><mml:mi>A</mml:mi><mml:mi>L</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mtext>otherwise</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>We cannot show that <inline-formula><mml:math id="M159"><mml:msup><mml:mi>D</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:msub><mml:menclose notation='updiagonalstrike'><mml:mo>&#x022A2;</mml:mo></mml:menclose><mml:mrow><mml:mi>D</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>&#x000AC;</mml:mo><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:math></inline-formula> iff <inline-formula><mml:math id="M160"><mml:mi>I</mml:mi><mml:mo>&#x022A7;</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x02227;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. To disprove &#x000AC;<italic>sat</italic>, the rule <italic>r</italic><sub><italic>sat</italic></sub> has to be applicable. This means we need to prove <italic>&#x003D5;</italic><sub><italic>i</italic></sub>. This implies that for each <italic>&#x003D5;</italic><sub><italic>i</italic></sub> at least one of the rules <italic>r</italic><sub><italic>i</italic>, 1</sub>, <italic>r</italic><sub><italic>i</italic>, 2</sub> and <italic>r</italic><sub><italic>i</italic>, 3</sub> is applicable too. Consequently, one of <inline-formula><mml:math id="M161"><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula>, <inline-formula><mml:math id="M162"><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula>, and <inline-formula><mml:math id="M163"><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula> is derivable. Given there are no rules for <inline-formula><mml:math id="M164"><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, <inline-formula><mml:math id="M165"><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is provable iff <inline-formula><mml:math id="M166"><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02208;</mml:mo><mml:mi>C</mml:mi></mml:math></inline-formula>. Accordingly, <inline-formula><mml:math id="M167"><mml:mi>I</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mi>E</mml:mi></mml:math></inline-formula>. Thus, for every clause we have an element in it that makes the clause true, thus <italic>I</italic>(<italic>&#x003D5;</italic><sub><italic>i</italic></sub>) &#x0003D; <italic>TRUE</italic>, for every <italic>i</italic> and so the 3-SAT instance is satisfiable. Conversely, when <inline-formula><mml:math id="M168"><mml:mi>I</mml:mi><mml:mo>&#x022A7;</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x02227;</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup><mml:msub><mml:mrow><mml:mi>&#x003D5;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, <italic>I</italic>&#x022A7;<italic>&#x003D5;</italic><sub><italic>i</italic></sub> for every 1 &#x02264; <italic>i</italic> &#x02264; <italic>n</italic>. Thus, for each <italic>&#x003D5;</italic><sub><italic>i</italic></sub>, there is a <inline-formula><mml:math id="M169"><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> such that <inline-formula><mml:math id="M170"><mml:mi>I</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:mi>E</mml:mi></mml:math></inline-formula>, and so <inline-formula><mml:math id="M171"><mml:msubsup><mml:mrow><mml:mi>&#x003C8;</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02208;</mml:mo><mml:mi>C</mml:mi></mml:math></inline-formula>. Therefore, <inline-formula><mml:math id="M172"><mml:msup><mml:mi>D</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:msub><mml:mo>&#x022A2;</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msub><mml:msubsup><mml:mi>&#x003C8;</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:math></inline-formula>, from which we derive that for every <italic>i</italic>, <inline-formula><mml:math id="M173"><mml:msup><mml:mi>D</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:msub><mml:mo>&#x022A2;</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msub><mml:msub><mml:mi>&#x003D5;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>, making <italic>r</italic><sub><italic>sat</italic></sub> applicable, which implies <inline-formula><mml:math id="M174"><mml:msup><mml:mi>D</mml:mi><mml:mo>&#x02032;</mml:mo></mml:msup><mml:msub><mml:menclose notation='updiagonalstrike'><mml:mo>&#x022A2;</mml:mo></mml:menclose><mml:mrow><mml:mi>D</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>&#x000AC;</mml:mo><mml:mi>s</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi></mml:math></inline-formula>.</p>
<p>Of course, the following holds as well.</p>
<p>Theorem 2. Given a theory <italic>D</italic> and an explanation by sufficient facts <inline-formula><mml:math id="M175"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>F</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> relative to <italic>D</italic>, the problem of determining if <inline-formula><mml:math id="M176"><mml:mrow><mml:mstyle mathvariant="script"><mml:mtext>F</mml:mtext></mml:mstyle></mml:mrow></mml:math></inline-formula> is not stable is NP-complete.</p>
</app>
</app-group>
</back>
</article>