{"title":"Kettle logic in abstract argumentation","authors":"Timotheus Kampik","doi":"10.1093/logcom/exad027","DOIUrl":null,"url":null,"abstract":"\n Kettle logic is a colloquial term that describes an agent’s advancement of inconsistent arguments in order to defeat a particular claim. Intuitively, a consistent subset of the advanced arguments should exist that is at least as successful at refuting the claim as the advancement of the set of inconsistent arguments. In this paper, we formalize this intuition and provide a formal analysis of kettle logic in abstract argumentation, a fundamental approach to computational argumentation, showing that all of the analysed abstract argumentation semantics (inference functions)—with the exception of naive semantics, which is considered a mere simplistic helper for the construction of other semantics—suffer from kettle logic. We also provide an approach to mitigating kettle logic under some circumstances. The key findings presented in this paper highlight that agents that apply the inference functions of abstract argumentation, are—similarly to humans—receptive to persuasion by agents who deliberately advance inconsistent and intuitively ‘illogical’ claims. As abstract argumentation can be considered one of the most basic models of computational argumentation, this raises the question to what extent and under what circumstances kettle logic-free argumentation can and should be enforced by computational means.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-05-25","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://doi.org/10.1093/logcom/exad027","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Kettle logic is a colloquial term that describes an agent’s advancement of inconsistent arguments in order to defeat a particular claim. Intuitively, a consistent subset of the advanced arguments should exist that is at least as successful at refuting the claim as the advancement of the set of inconsistent arguments. In this paper, we formalize this intuition and provide a formal analysis of kettle logic in abstract argumentation, a fundamental approach to computational argumentation, showing that all of the analysed abstract argumentation semantics (inference functions)—with the exception of naive semantics, which is considered a mere simplistic helper for the construction of other semantics—suffer from kettle logic. We also provide an approach to mitigating kettle logic under some circumstances. The key findings presented in this paper highlight that agents that apply the inference functions of abstract argumentation, are—similarly to humans—receptive to persuasion by agents who deliberately advance inconsistent and intuitively ‘illogical’ claims. As abstract argumentation can be considered one of the most basic models of computational argumentation, this raises the question to what extent and under what circumstances kettle logic-free argumentation can and should be enforced by computational means.
期刊介绍:
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.