Collective argumentation with topological restrictions: the case of aggregating abstract argumentation frameworks

被引:0
作者
Chen, Weiwei [1 ,2 ]
机构
[1] Sun Yat sen Univ, Inst Logic & Cognit, Guangzhou 510275, Peoples R China
[2] Sun Yat sen Univ, Dept Philosophy, Guangzhou 510275, Peoples R China
关键词
Collective argumentation; topological property; social choice theory; domain restriction; POSSIBILITY THEOREM; ACCEPTABILITY;
D O I
10.1093/logcom/exac096
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Collective argumentation is the process of reaching a collective decision that is acceptable to the group in a debate. We introduce the notion of topological restriction to enrich the study of collective argumentation. Topological restrictions are rational constraints assumed to be satisfied by individual agents. We assume that in a debate, for every pair of arguments under consideration, every agent indicates whether the first argument attacks the second, i.e. an agent's argumentative stance is characterized as an argumentation framework, and only argumentation frameworks that satisfy topological restrictions are allowed. The topological restrictions we consider in this paper include various topological properties in the literature, such as acyclicity, symmetry, coherence and determinedness, as well as three topological restrictions that generalize classic social-choice-theoretic domain conditions. We show that when the profile of the argumentation frameworks provided by the agents satisfies topological restrictions, impossibility results during aggregation can be avoided. Furthermore, if a profile is topologically restricted with respect to restrictions that generalize domain conditions, then the majority rule preserves several desirable properties during aggregation.
引用
收藏
页码:319 / 343
页数:25
相关论文
共 50 条
[1]  
Bodanza GA, 2009, LECT NOTES COMPUT SC, V5590, P95, DOI 10.1007/978-3-642-02906-6_10
[2]  
Arrow K. J., 2012, Social Choice and Individual Values, VThird
[3]  
Arrow Kenneth, 2002, Handbook of Social Choice and Welfare
[4]   SCC-recursiveness: a general schema for argumentation semantics [J].
Baroni, P ;
Giacomin, M ;
Guida, G .
ARTIFICIAL INTELLIGENCE, 2005, 168 (1-2) :162-210
[5]  
Baroni P., 2007, P 1 INT WORKSH ARG N, P33
[6]  
Baroni P., 2018, Handbook of Formal Argumentation
[7]   On principle-based evaluation of extension-based argumentation semantics [J].
Baroni, Pietro ;
Giacomin, Massimiliano .
ARTIFICIAL INTELLIGENCE, 2007, 171 (10-15) :675-700
[8]  
Barringer H, 2005, LECT NOTES ARTIF INT, V2605, P59
[9]  
Baumeister D, 2021, J APPL LOG-IFCOLOG, V8, P1503
[10]  
Bikakis A, 2021, J APPL LOG-IFCOLOG, V8, P1437