Acyclic Argumentation: Attack = Conflict + Preference (bibtex)

by S. Kaci, L. van der Torre, E. Weydert

Abstract:

In this paper we study the fragment of Dung's argumentation theory in which the strict attack relation is acyclic. We show that every attack relation satisfying a particular property can be represented by a symmetric conflict relation and a transitive preference relation in the following way.We define an instance of Dung's abstract argumentation theory, in which `argument A attacks argument B' is defined as `argument A conflicts with argument B' and `argument A is at least as preferred as argument B', where the conflict relation is symmetric and the preference relation is transitive.We show that this new preference-based argumentation theory characterizes the acyclic strict attack relation, in the sense that every attack relation defined as such a combination satisfies the property, and for every attack relation satisfying the property we can find a symmetric conflict relation and a transitive preference relation satisfying the equation.

Reference:

Acyclic Argumentation: Attack = Conflict + Preference (S. Kaci, L. van der Torre, E. Weydert), In ECAI 2006, 17th European Conference on Artificial Intelligence, August 29 - September 1, 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings (G. Brewka, S. Coradeschi, A. Perini, P. Traverso, eds.), IOS Press, 2006.

Bibtex Entry:

@InProceedings{Kaci2006, Title = {Acyclic Argumentation: Attack = Conflict + Preference}, Author = {S. Kaci and L. van der Torre and E. Weydert}, Booktitle = {ECAI 2006, 17th European Conference on Artificial Intelligence, August 29 - September 1, 2006, Riva del Garda, Italy, Including Prestigious Applications of Intelligent Systems (PAIS 2006), Proceedings}, Year = {2006}, Editor = {G. Brewka and S. Coradeschi and A. Perini and P. Traverso}, Pages = {725-726}, Publisher = {IOS Press}, Abstract = {In this paper we study the fragment of Dung's argumentation theory in which the strict attack relation is acyclic. We show that every attack relation satisfying a particular property can be represented by a symmetric conflict relation and a transitive preference relation in the following way.We define an instance of Dung's abstract argumentation theory, in which `argument A attacks argument B' is defined as `argument A conflicts with argument B' and `argument A is at least as preferred as argument B', where the conflict relation is symmetric and the preference relation is transitive.We show that this new preference-based argumentation theory characterizes the acyclic strict attack relation, in the sense that every attack relation defined as such a combination satisfies the property, and for every attack relation satisfying the property we can find a symmetric conflict relation and a transitive preference relation satisfying the equation. }, Affiliation = {icr}, Bdsk-url-1 = {http://icr.uni.lu/leonvandertorre/papers/ecai06d.pdf}, Bibsource = {DBLP, http://dblp.uni-trier.de}, ISBN = {1-58603-642-4}, Timestamp = {2013.07.26}, Url = {http://icr.uni.lu/leonvandertorre/papers/ecai06d.pdf} }

Powered by bibtexbrowser