Document Type

Technical Report

Rights

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

Disciplines

Computer Sciences

Publication Details

Technical report, originally submitted to IJCAI 2019 conference but not published. The material has not been published and it is not currently under revision.

Abstract

The concept of ambiguous literals of defeasible logics is mapped to the set of undecided arguments identified by an argumentation semantics. It follows that Dung’s complete semantics are all ambiguity propagating, since the undecided status of an attacking argument is always propagated to the attacked argument, unless the latter is defeated by another accepted argument. In this paper we investigate a novel family of abstract argumentation semantics, called weakly-admissible semantics, where we do not require an acceptable argument to be necessarily defended from the attacks of undecided arguments. Weakly-admissible semantics are conflict-free, ambiguity blocking, non-admissible (in Dung’s sense), but employing a more relaxed defence-based notion of admissibility; they allow reinstatement and generate extensions that are super-sets of grounded semantics, and they at least accept credulously what Dung’s complete semantics accept at least credulously.

Download


Share

COinS