On the resolution-based family of abstract argumentation semantics and its grounded instance

作者:

Highlights:

摘要

This paper introduces a novel parametric family of semantics for abstract argumentation called resolution-based and analyzes in particular the resolution-based version of the traditional grounded semantics, showing that it features the unique property of satisfying a set of general desirable properties recently introduced in the literature. Additionally, an investigation of its computational complexity properties reveals that resolution-based grounded semantics is satisfactory also from this perspective.

论文关键词:Abstract argumentation semantics,Argumentation framework,Grounded semantics,Semantics evaluation criteria,Computational complexity

论文评审过程:Received 14 January 2010, Revised 11 October 2010, Accepted 16 November 2010, Available online 19 November 2010.

论文官网地址:https://doi.org/10.1016/j.artint.2010.11.005