Preferences and Unrestricted Rebut

Martinus Wigbertus Antonius Caminada, Sanjay Modgil, Nir Oren

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

19 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). Amsterdam: IOS Press. https://doi.org/10.3233/978-1-61499-436-7-209

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 proceedingConference contribution

Caminada, MWA, Modgil, S & Oren, N 2014, Preferences and Unrestricted Rebut. in Computational Models of Argument: Proceedings of COMMA 2014. Frontiers in Artificial Intelligence and Applications, vol. 266, IOS Press, Amsterdam, pp. 209-220. https://doi.org/10.3233/978-1-61499-436-7-209
Caminada MWA, Modgil S, Oren N. Preferences and Unrestricted Rebut. In Computational Models of Argument: Proceedings of COMMA 2014. Amsterdam: IOS Press. 2014. p. 209-220. (Frontiers in Artificial Intelligence and Applications). https://doi.org/10.3233/978-1-61499-436-7-209
Caminada, Martinus Wigbertus Antonius ; Modgil, Sanjay ; Oren, Nir. / Preferences and Unrestricted Rebut. Computational Models of Argument: Proceedings of COMMA 2014. Amsterdam : IOS Press, 2014. pp. 209-220 (Frontiers in Artificial Intelligence and Applications).
@inproceedings{c1debe37179e4994a4b9a7d34729e76f,
title = "Preferences and Unrestricted Rebut",
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",
author = "Caminada, {Martinus Wigbertus Antonius} and Sanjay Modgil and Nir Oren",
year = "2014",
doi = "10.3233/978-1-61499-436-7-209",
language = "English",
isbn = "9781614994350",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press",
pages = "209--220",
booktitle = "Computational Models of Argument",

}

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 -