| Reference : On the Acceptability of Incompatible Arguments |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/10993/25082 | |||
| On the Acceptability of Incompatible Arguments | |
| English | |
| Kaci, Souhila [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >] | |
van der Torre, Leon  [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >] | |
| Weydert, Emil [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >] | |
| 2007 | |
| Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 9th European Conference, ECSQARU 2007, Hammamet, Tunisia, October 31 – November 2, 2007, Proceedings | |
| Springer | |
| Lecture Notes in Computer Science 4724 | |
| 247–258 | |
| Yes | |
| International | |
| 978-3-540-75255-4 | |
| Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 9th European Conference, ECSQARU 2007, Hammamet, Tunisia, October 31 – November 2, 2007, Proceedings | |
| 2007 | |
| [en] acceptability of incompatible arguments ; argumentation framework | |
| [en] In this paper we study the acceptability of incompatible arguments within Dung’s abstract argumentation framework. As an example we introduce an instance of Dung’s framework where arguments are represented by propositional formulas and an argument attacks another one when the conjunction of their representations is inconsistent, which we characterize as a kind of symmetric attack. Since symmetric attack is known to have the drawback to collapse the various argumentation semantics, we consider also two variations. First, we consider propositional arguments distinguishing support and conclusion. Second, we introduce a preference ordering over the arguments and we define the attack relation in terms of a symmetric incompatibility relation and the preference relation. We show how to characterize preference-based argumentation using a kind of acyclic attack relation. | |
| Researchers ; Professionals ; Students ; General public ; Others | |
| http://hdl.handle.net/10993/25082 | |
| 10.1007/978-3-540-75256-1_24 | |
| http://link.springer.com/chapter/10.1007%2F978-3-540-75256-1_24 | |
| 4724 |
There is no file associated with this reference.
All documents in ORBilu are protected by a user license.
