A Study of Argumentative Characterisations of Preferred Subtheories
Abstract
Classical logic argumentation (Cl-Arg) under the stable semantics yields argumentative characterisations of non-monotonic inference in Preferred Subtheories. This paper studies these characterisations under both the standard approach to Cl-Arg, and a recent dialectical approach that is provably rational under resource bounds. Two key contributions are made. Firstly, the preferred extensions are shown to coincide with the stable extensions. This means that algorithms and proof theories for the admissible semantics can now be used to decide credulous inference in Preferred Subtheories. Secondly, we show that as compared with the standard approach, the grounded semantics applied to the dialectical approach more closely approximates sceptical inference in Preferred Subtheories.
Cite
Text
D'Agostino and Modgil. "A Study of Argumentative Characterisations of Preferred Subtheories." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/247Markdown
[D'Agostino and Modgil. "A Study of Argumentative Characterisations of Preferred Subtheories." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/daposagostino2018ijcai-study/) doi:10.24963/IJCAI.2018/247BibTeX
@inproceedings{daposagostino2018ijcai-study,
title = {{A Study of Argumentative Characterisations of Preferred Subtheories}},
author = {D'Agostino, Marcello and Modgil, Sanjay},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2018},
pages = {1788-1794},
doi = {10.24963/IJCAI.2018/247},
url = {https://mlanthology.org/ijcai/2018/daposagostino2018ijcai-study/}
}