Atteintes systémiques chez les patients présentant des nécroses digitales au cours de la sclérodermie (étude transversale portant sur 94 patients)

BORDEAUX2-BU Santé (330632101) / SudocPARIS-BIUM (751062103) / SudocSudocFranceF

RAFDivider

special acknowledgement to Mickaël LAFAGESThe topic of this work is related to a computational issue concerning an enriched abstract argumentation framework called RAF ("Recursive Argumentation Framework"). A RAF is composed of a set of arguments and a binary relation modelling the attacks as in Dung's framework. The main difference between Dung's framework and RAF is the fact that a RAF is able to take into account higher-order interactions (i.e. an attack can target an attack and not only an argument). Since this kind of framework is relatively recent, the efficient computation of the main semantics remains an open question. In this paper, we propose one of the first algorithms dedicated to this issue. We also prove the soundness and the completeness of our algorithms

Computing the Labellings of Higher-Order Abstract Argumentation Frameworks

International audienceThe topic of this work is related to a computational issue concerning an enriched abstract argumentation framework called RAF (“Recursive Argumentation Framework”). A RAF is composed of a set of arguments and a binary relation modelling the attacks as in Dung’s framework. The main difference between Dung’s framework and a RAF is the fact that a RAF is able to take into account higher-order interactions (i.e. an attack can target an attack and not only an argument). Since this kind of framework is relatively recent, the efficient computation of the main semantics remains an open question. In this paper, we propose one of the first algorithms dedicated to this issue. We prove the soundness and completeness of this algorithm

Importance of patients' photographs for urticaria diagnosis

International audienceNo abstract availabl

Argumentation Frameworks with Higher-Order Attacks: Semantics and Complexity

Poster presented in the 17th International Conference on Principles of Knowledge Representation and Reasoning)International audienc

Visual Explanations for Defence in Abstract Argumentation

International audienceThe Verification Problem in abstract argumentation consists in checking whether a set is acceptable under a given semantics in a given argumentation graph. Explaining why the answer is so is the challenge tackled by our work. In this extended abstract, we focus on a small part of this aim considering only the defence principle and proposing explanations in order to explain why a subset of arguments defends all its elements. These explanations are visual, in the sense that they take the form of subgraphs of the initial argumentation framework. They form a class, whose properties are investigated