Revisiting Unrestricted Rebut and Preferences in Structured Argumentation.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. Main track. Pages 1088-1092.
https://doi.org/10.24963/ijcai.2017/151
Keywords
- Knowledge Representation, Reasoning, and Logic: Logics for Knowledge Representation
- Knowledge Representation, Reasoning, and Logic: Computational models of Argument
- Knowledge Representation, Reasoning, and Logic: Preferences
- Knowledge Representation, Reasoning, and Logic: Non-monotonic Reasoning
Abstract
In structured argumentation frameworks such as ASPIC+, rebuts are only allowed in conclusions produced by defeasible rules. This has been criticized as counter-intuitive especially in dialectical contexts. In this paper we show that ASPIC-, a system allowing for unrestricted rebuts, suffers from contamination problems. We remedy this shortcoming by generalizing the attack rule of unrestricted rebut. Our resulting system satisfies the usual rationality postulates for prioritized rule bases.
@inproceedings{ijcai2017p151,
title = {Revisiting Unrestricted Rebut and Preferences in Structured Argumentation.},
author = {Heyninck, Jesse and Straßer, Christian},
booktitle = {Proceedings of the Twenty-Sixth International Joint Conference on
Artificial Intelligence, {IJCAI-17}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Carles Sierra, IIIA-CSIC},
pages = {1088--1092},
year = {2017},
month = {8},
note = {Main track},
doi = {10.24963/ijcai.2017/151},
url = {https://doi.org/10.24963/ijcai.2017/151},
}
TY - CPAPER TI - Revisiting Unrestricted Rebut and Preferences in Structured Argumentation. AU - Heyninck, Jesse AU - Straßer, Christian T2 - Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17 PB - International Joint Conferences on Artificial Intelligence Organization PY - 2017 SP - 1088 EP - 1092 DO - 10.24963/ijcai.2017/151 UR - https://doi.org/10.24963/ijcai.2017/151 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: