A mathematical treatment of defeasible reasoning and its implementation
Artificial Intelligence
Abstract argumentation systems
Artificial Intelligence
Dialectic semantics for argumentation frameworks
ICAIL '99 Proceedings of the 7th international conference on Artificial intelligence and law
A System for Defeasible Argumentation, with Defeasible Priorities
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
Defeasible logic programming: an argumentative approach
Theory and Practice of Logic Programming
On the acceptability of arguments in preference-based argumentation
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Strong and Weak Forms of Abstract Argument Defense
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Argument Theory Change: Revision Upon Warrant
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Generalized Abstract Argumentation: Handling Arguments in FOL Fragments
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Dialectical abstract argumentation: a characterization of the marking criterion
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On defense strength of blocking defeaters in admissible sets
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
A Dynamic Argumentation Framework
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Instantiating abstract argumentation with classical logic arguments: Postulates and properties
Artificial Intelligence
Stable extensions in timed argumentation frameworks
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
An argumentation framework for non-monotonic reasoning in description logic
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Hi-index | 0.00 |
Abstract argumentation systems are formalisms for defeasible reasoning where some components remain unspecified, the structure of arguments being the main abstraction. In the dialectical process carried out to identify accepted arguments in the system some controversial situations may appear. These relate to the reintroduction of arguments into the process which cause the onset of circularity. This must be avoided in order to prevent an infinite analysis. Some systems apply the sole restriction of not allowing the introduction of previously considered arguments in an argumentation line. However, repeating an argument is not the only possible cause for the risk mentioned, as subarguments must be taken into account. In this work, we introduce an extended argumentation framework and a definition for progressive defeat path. A credulous extension is also presented.