Preferences and Unrestricted Rebut

Martinus Wigbertus Antonius Caminada, Sanjay Modgil, Nir Oren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Citations (Scopus)

Abstract

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
Original languageEnglish
Title of host publicationComputational Models of Argument
Subtitle of host publicationProceedings of COMMA 2014
Place of PublicationAmsterdam
PublisherIOS Press
Pages209-220
Number of pages12
ISBN (Electronic)9781614994367
ISBN (Print)9781614994350
DOIs
Publication statusPublished - 2014

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press
Volume266

Cite this

Caminada, M. W. A., Modgil, S., & Oren, N. (2014). Preferences and Unrestricted Rebut. In Computational Models of Argument: Proceedings of COMMA 2014 (pp. 209-220). (Frontiers in Artificial Intelligence and Applications; Vol. 266). IOS Press. https://doi.org/10.3233/978-1-61499-436-7-209