Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation

Explainability of Extension-Based Semantics

Abstract : This paper defines visual explanations to the Verification Problem in argumentation, that is, of why a set of arguments is or is not acceptable under a given semantics. These explanations rely upon the modularity of the acceptability semantics, and they take the form of subgraphs of the original argumentation graph. Graph properties that these subgraphs satisfy depending on whether or not the set is acceptable, are established. Properties of the proposed explanations are addressed, and the potential of the modularity of the approach is highlighted. Note that this research report is the complete version of a paper submitted to a conference. In this complete version, the reader can find the proofs of the results given in the submitted paper.
Document type :
Complete list of metadata
Contributor : Marie-Christine Lagasquie-Schiex Connect in order to contact the contributor
Submitted on : Monday, May 2, 2022 - 3:50:04 PM
Last modification on : Monday, July 4, 2022 - 10:03:32 AM


rapport_IRIT_RR_2022_05_FR (1)...
Files produced by the author(s)


  • HAL Id : hal-03657060, version 1


Sylvie Doutre, Théo Duchatelle, Marie-Christine Lagasquie-Schiex. Explainability of Extension-Based Semantics. [Research Report] IRIT/RR--2022--05--FR, IRIT - Institut de Recherche en Informatique de Toulouse. 2022, pp.1-20. ⟨hal-03657060⟩



Record views


Files downloads