Progressive defeat paths in abstract argumentation frameworks

Authors:
Diego C. Martínez;Alejandro J. García;Guillermo R. Simari
Affiliations:
Artificial Intelligence Research and Development Laboratory, Department of Computer Science and Engineering, Universidad Nacional del Sur, Bahía Blanca, Buenos Aires, República Argentina;Artificial Intelligence Research and Development Laboratory, Department of Computer Science and Engineering, Universidad Nacional del Sur, Bahía Blanca, Buenos Aires, República Argentina;Artificial Intelligence Research and Development Laboratory, Department of Computer Science and Engineering, Universidad Nacional del Sur, Bahía Blanca, Buenos Aires, República Argentina
Venue:
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Year:
2006

Citing 5
Cited 5

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
Defeasible logic programming: an argumentative approach

Theory and Practice of Logic Programming
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning and logic programming

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2

On Acceptability in Abstract Argumentation Frameworks with an Extended Defeat Relation

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Strong and Weak Forms of Abstract Argument Defense

Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
On defense strength of blocking defeaters in admissible sets

KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Moving Between Argumentation Frameworks

Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Arguing using opponent models

ArgMAS'09 Proceedings of the 6th international conference on Argumentation in Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. A more specific restriction needs to be applied considering the existence of subarguments. In this work, we introduce an extended argumentation framework where two kinds of defeat relation are present, and a definition for progressive defeat path.