Preferences and Unrestricted Rebut

Martinus Wigbertus Antonius Caminada, Sanjay Modgil, Nir Oren

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution

33 Citations (Scopus)
5 Downloads (Pure)


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
Number of pages12
ISBN (Electronic)9781614994367
ISBN (Print)9781614994350
Publication statusPublished - 2014

Publication series

NameFrontiers in Artificial Intelligence and Applications
PublisherIOS Press

Cite this