Learn More
Dung's argumentation system takes as input a set of arguments and a binary relation encoding attacks among these arguments, and returns different extensions of arguments. However, no indication is given on how to instantiate this setting, i.e. how to build arguments from a knowledge base and how to choose an appropriate attack relation. This leads in some(More)
Dung's argumentation framework takes as input two abstract entities: a set of arguments and a binary relation encoding attacks between these arguments. It returns acceptable sets of arguments, called extensions, wrt a given semantics. While the abstract nature of this setting is seen as a great advantage, it induces a big gap with the application that it is(More)
Here we present a new paraconsistent logic, called quasi-classical logic (or QC logic) that allows the derivation of non-trivializable classical inferences. For this it is necessary that queries are in conjunc-tive normal form and the reasoning process is essentially that of clause nding. We present a proof-theoretic deenition, and semantics, and show that(More)
The problem of combining pieces of information issued from several sources can be encountered in various fields of application. This paper aims at presenting the different aspects of information fusion in different domains, such as databases, regulations, preferences , sensor fusion, etc., at a quite general level. We first present different types of(More)