# A Formal Analysis of Logic-Based Argumentation Systems

@inproceedings{Amgoud2010AFA, title={A Formal Analysis of Logic-Based Argumentation Systems}, author={Leila Amgoud and Philippe Besnard}, booktitle={SUM}, year={2010} }

Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined for evaluating the arguments. What is worth noticing is that the model completely abstracts from the applications to which it can be applied. Thus, it is not clear what are the results that can be returned in a given application by each semantics. This paper answers this question. For that purpose, we start by plunging the…

## 40 Citations

Logical limits of abstract argumentation frameworks

- Computer ScienceJ. Appl. Non Class. Logics
- 2013

The study reveals that stable, semi-stable and preferred semantics either lead to counter-intuitive results or provide no added value w.r.t. a given semantics, which is problematic when applied over deductive logical formalisms.

Maxi-Consistent Operators in Argumentation

- Computer ScienceECAI
- 2012

This paper studies an instantiation of Dung-style argumentation system with classical propositional logic to better understand the role of argumentation and, more particularly, the expressivity of logic-based instantiations of D Bung- style argumentation frameworks.

Between Argument and Conclusion - Argument-based Approaches to Discussion, Inference and Uncertainty

- Computer Science
- 2012

This thesis provides a more refined notion of the overall status of arguments based on the notion of a complete labelling and defines a set of conditions under which the ASPIC Lite system satisfies all the mentioned rationality postulates under complete semantics.

Identifying the Class of Maxi-Consistent Operators in Argumentation

- Computer ScienceJ. Artif. Intell. Res.
- 2013

This paper identifies and studies the large class of logic-based instantiations of Dung's theory which correspond to the maxi-consistent operator, i.e. to the function which returns maximal consistent subsets of an inconsistent knowledge base.

A formal characterization of the outcomes of rule-based argumentation systems

- Computer ScienceKnowledge and Information Systems
- 2018

This paper presents the first study of the outcomes of such systems under various acceptability semantics, namely naive, stable, semi-stable, preferred, grounded and ideal, on the family of inconsistency-based attack relations.

A new approach for preference-based argumentation frameworks

- Computer ScienceAnnals of Mathematics and Artificial Intelligence
- 2011

This paper proposes an approach that guarantees conflict-free extensions of argumentation framework and presents three dominance relations that generalize respectively stable, preferred and grounded semantics with preferences and retrieves the preferred sub-theories which were proposed in the context of handling inconsistency in weighted knowledge bases.

Stable Semantics in Logic-Based Argumentation

- Computer ScienceSUM
- 2012

This paper investigates the outputs of abstract logic-based argumentation systems under stable semantics. We delimit the number of stable extensions a system may have. We show that in the best case,…

Formalisation and logical properties of the maximal ideal recursive semantics for weighted defeasible logic programming

- Computer ScienceJ. Exp. Theor. Artif. Intell.
- 2016

An argumentation framework for RP-DeLP that is able to compute not only the output of warranted and blocked conclusions, but also explain the reasons behind the status of each conclusion is implemented.

A Sequent-Based Representation of Logical Argumentation

- PhilosophyCLIMA
- 2013

It is shown that arguments may be represented by Gentzen-type sequents and that attacks between arguments may been represented by sequent elimination rules, implying that argumentation theory may benefit from incorporating techniques of proof theory and that different non-classical formalisms may be used for backing up intended argumentation semantics.

## References

SHOWING 1-10 OF 18 REFERENCES

Bridging the Gap between Abstract Argumentation Systems and Logic

- Computer ScienceSUM
- 2009

This paper argues that an attack relation should be at least grounded on the minimal conflicts contained in the knowledge base, and shows how to build arguments from a knowledge base using the consequence operator of the logic.

On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games

- Computer ScienceArtif. Intell.
- 1995

SCC-recursiveness: a general schema for argumentation semantics

- Computer ScienceArtif. Intell.
- 2005

Elements of Argumentation

- PhilosophyECSQARU
- 2007

The need to take intrinsic and extrinsic factors into account is considered, and ways that this can be done in logic in order to refine existing logic-based approaches to argumentation are considered.

On the Relation between Argumentation and Non-monotonic Coherence-Based Entailment

- PhilosophyIJCAI
- 1995

A formal correspondence between the so-called argumentation paradigm and recent work on nonmonotonic entailment is established and several directions for further research concerning the integration of preference relations into argumentation systems are proposed.

A Mathematical Treatment of Defeasible Reasoning and its Implementation

- Computer ScienceArtif. Intell.
- 1992

Inferring from Inconsistency in Preference-Based Argumentation Frameworks

- PhilosophyJournal of Automated Reasoning
- 2004

This paper investigates preference-based acceptability, the basic idea is to accept undefeated arguments and also arguments that are preferred to their defeaters, and defines argumentation frameworks based on that preference- based acceptability.

Reaching Agreements Through Argumentation: A Logical Model and Implementation

- Computer ScienceArtif. Intell.
- 1998