Abstract
Classical logic argumentation (Cl-Arg) under the stablesemanticsyieldsargumentativecharacterisationsofnon-monotonicinferenceinPreferredSubtheories. This paper studies these characterisations under both the standard approach to Cl-Arg, and a recentdialecticalapproachthatisprovablyrational 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
Original language | English |
---|---|
Title of host publication | International Joint Conference on Artificial Intelligence and European Conference on Artificial Intelligence 2018 |
Number of pages | 7 |
Publication status | Accepted/In press - May 2018 |