Document Type

Conference Paper

Rights

This item is available under a Creative Commons License for non-commercial use only

Disciplines

1.2 COMPUTER AND INFORMATION SCIENCE, Computer Sciences

Publication Details

http://ceur-ws.org/Vol-2296/

Abstract

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.

Share

COinS