{"title":"具有拓扑限制的集体论证:聚合抽象论证框架的案例","authors":"Weiwei Chen","doi":"10.1093/logcom/exac096","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"33 2","pages":"319-343"},"PeriodicalIF":0.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collective argumentation with topological restrictions: the case of aggregating abstract argumentation frameworks\",\"authors\":\"Weiwei Chen\",\"doi\":\"10.1093/logcom/exac096\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":50162,\"journal\":{\"name\":\"Journal of Logic and Computation\",\"volume\":\"33 2\",\"pages\":\"319-343\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Logic and Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10068390/\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logic and Computation","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10068390/","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Collective argumentation with topological restrictions: the case of aggregating abstract argumentation frameworks
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.
期刊介绍:
Logic has found application in virtually all aspects of Information Technology, from software engineering and hardware to programming and artificial intelligence. Indeed, logic, artificial intelligence and theoretical computing are influencing each other to the extent that a new interdisciplinary area of Logic and Computation is emerging.
The Journal of Logic and Computation aims to promote the growth of logic and computing, including, among others, the following areas of interest: Logical Systems, such as classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, feasible maths.... Logical issues in logic programming, knowledge-based systems and automated reasoning; logical issues in knowledge representation, such as non-monotonic reasoning and systems of knowledge and belief; logics and semantics of programming; specification and verification of programs and systems; applications of logic in hardware and VLSI, natural language, concurrent computation, planning, and databases. The bulk of the content is technical scientific papers, although letters, reviews, and discussions, as well as relevant conference reviews, are included.