{"title":"在论证框架上传播真理度:模糊论证的抽象描述","authors":"Pierpaolo Dondio","doi":"10.1145/3019612.3019717","DOIUrl":null,"url":null,"abstract":"This paper proposes a computational framework to reason with conflicting and gradual evidence. The framework is a synthesis of Dung's seminal work in argumentation semantics with multi-valued logic. Abstract grounded semantics is used to identify the conditions under which a conclusion can be accepted, while multi-valued logic operators are used to quantify the degree of truth of such conditions. We propose a truth-compositional recursive computation based on the notion of irrelevant arguments, and we discuss examples using the major multi-valued logics: Godel's, Zadeh's and Łukasiewicz's logic.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Propagating degrees of truth on an argumentation framework: an abstract account of fuzzy argumentation\",\"authors\":\"Pierpaolo Dondio\",\"doi\":\"10.1145/3019612.3019717\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a computational framework to reason with conflicting and gradual evidence. The framework is a synthesis of Dung's seminal work in argumentation semantics with multi-valued logic. Abstract grounded semantics is used to identify the conditions under which a conclusion can be accepted, while multi-valued logic operators are used to quantify the degree of truth of such conditions. We propose a truth-compositional recursive computation based on the notion of irrelevant arguments, and we discuss examples using the major multi-valued logics: Godel's, Zadeh's and Łukasiewicz's logic.\",\"PeriodicalId\":20728,\"journal\":{\"name\":\"Proceedings of the Symposium on Applied Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Symposium on Applied Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3019612.3019717\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3019612.3019717","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Propagating degrees of truth on an argumentation framework: an abstract account of fuzzy argumentation
This paper proposes a computational framework to reason with conflicting and gradual evidence. The framework is a synthesis of Dung's seminal work in argumentation semantics with multi-valued logic. Abstract grounded semantics is used to identify the conditions under which a conclusion can be accepted, while multi-valued logic operators are used to quantify the degree of truth of such conditions. We propose a truth-compositional recursive computation based on the notion of irrelevant arguments, and we discuss examples using the major multi-valued logics: Godel's, Zadeh's and Łukasiewicz's logic.