Abstract
| Original language | English |
|---|---|
| Title of host publication | Computational Models of Argument |
| Subtitle of host publication | Proceedings of COMMA 2014 |
| Place of Publication | Amsterdam |
| Publisher | IOS Press |
| Pages | 209-220 |
| Number of pages | 12 |
| ISBN (Electronic) | 9781614994367 |
| ISBN (Print) | 9781614994350 |
| DOIs | |
| Publication status | Published - 2014 |
Publication series
| Name | Frontiers in Artificial Intelligence and Applications |
|---|---|
| Publisher | IOS Press |
| Volume | 266 |
Cite this
Preferences and Unrestricted Rebut. / Caminada, Martinus Wigbertus Antonius; Modgil, Sanjay; Oren, Nir.
Computational Models of Argument: Proceedings of COMMA 2014. Amsterdam : IOS Press, 2014. p. 209-220 (Frontiers in Artificial Intelligence and Applications; Vol. 266).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Preferences and Unrestricted Rebut
AU - Caminada, Martinus Wigbertus Antonius
AU - Modgil, Sanjay
AU - Oren, Nir
PY - 2014
Y1 - 2014
N2 - The work of Caminada & Amgoud presents two possible ways of satisfying the rationality postulates: one using restricted rebut, and one using unrestricted rebut. Subsequent work on ASPIC+ has extended the work of Caminada & Amgoud, for instance by allowing preferences over arguments. However, such extensions have utilised restricted rebut only. In the current paper, we make the case for unrestricted rebut, and provide a formalism (called ASPIC-) that implements preferences between the defeasible rules, in the context of unrestricted rebut while still satisfying the rationality postulates of Caminada & Amgoud
AB - The work of Caminada & Amgoud presents two possible ways of satisfying the rationality postulates: one using restricted rebut, and one using unrestricted rebut. Subsequent work on ASPIC+ has extended the work of Caminada & Amgoud, for instance by allowing preferences over arguments. However, such extensions have utilised restricted rebut only. In the current paper, we make the case for unrestricted rebut, and provide a formalism (called ASPIC-) that implements preferences between the defeasible rules, in the context of unrestricted rebut while still satisfying the rationality postulates of Caminada & Amgoud
U2 - 10.3233/978-1-61499-436-7-209
DO - 10.3233/978-1-61499-436-7-209
M3 - Conference contribution
SN - 9781614994350
T3 - Frontiers in Artificial Intelligence and Applications
SP - 209
EP - 220
BT - Computational Models of Argument
PB - IOS Press
CY - Amsterdam
ER -