Preferences and Unrestricted Rebut

Martinus Wigbertus Antonius Caminada; Sanjay Modgil; Nir Oren

doi:10.3233/978-1-61499-436-7-209

Preferences and Unrestricted Rebut

Martinus Wigbertus Antonius Caminada, Sanjay Modgil, Nir Oren

Computing Science

King's College London

Research output: Chapter in Book/Report/Conference proceeding › Published conference contribution

33 Citations (Scopus)

5 Downloads (Pure)

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 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	https://doi.org/10.3233/978-1-61499-436-7-209
Publication status	Published - 2014

Publication series

Name	Frontiers in Artificial Intelligence and Applications
Publisher	IOS Press
Volume	266

Access to Document

10.3233/978-1-61499-436-7-209Licence: Unspecified

UnrestrictedcameraReadyMC
This is the author's accepted manuscript of a paper later published in Computational Models of Argument: Proceedings of COMMA 2014, IOS Press
Submitted manuscript, 295 KBLicence: Unspecified

Cite this

@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 - Published 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 -