@inproceedings{DBLP:conf/ecai/KaciTW06,
  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},
  author = {S. Kaci and L. van der Torre and E. Weydert},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  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},
  editor = {G. Brewka and S. Coradeschi and A. Perini and P. Traverso},
  isbn = {1-58603-642-4},
  pages = {725-726},
  publisher = {IOS Press},
  title = {Acyclic Argumentation: Attack = Conflict + Preference},
  url = {http://icr.uni.lu/leonvandertorre/papers/ecai06d.pdf},
  year = {2006},
  bdsk-url-1 = {http://icr.uni.lu/leonvandertorre/papers/ecai06d.pdf}
}