Available under a Creative Commons Attribution Non-Commercial Share Alike 4.0 International Licence
1.2 COMPUTER AND INFORMATION SCIENCE, Computer Sciences
Abstract. In this paper we discuss how the in dubio pro reo principle and the corresponding standard of proof beyond reasonable doubt can be modelled in abstract argumentation. The in dubio pro reo principle protects arguments against attacks from doubtful arguments. We identify doubtful arguments with a subset of undecided arguments, called active undecided arguments, consisting of cyclic arguments responsible for generating the undecided situation. We obtain the standard of proof beyond reasonable doubt by imposing that attacks from doubtful undecided arguments are not enough to change the acceptability status of an attacked argument (the reo). The resulting semantics, called SCCvoid semantics, are defined using a SCC-recursive schema. The semantics are conflict-free, non-admissible (in Dung’s sense), but employing a more relaxed defence-based notion of admissibility; they allow reinstatement and they accept credulously what the corresponding complete semantics accepts at least credulously.
Dondio, P. & Longo, L. (2018). Advances in Argumentation in Artificial Intelligence. Proceedings of the 2nd Workshop on Advances in Argumentation In Artificial Intelligence, co-located with XVII International Conference of the Italian Association for Artificial Intelligence (AI*IA2018), 20-23 November, Trento, Italy. doi:10.21427/t248-a312