Probabilistic causal bipolar abstract argumentation: an approach based on credal networks

IF 1.2 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Annals of Mathematics and Artificial Intelligence Pub Date : 2023-05-16 DOI:10.1007/s10472-023-09851-4
Mariela Morveli-Espinoza, Juan Carlos Nieves, Cesar Augusto Tacla
{"title":"Probabilistic causal bipolar abstract argumentation: an approach based on credal networks","authors":"Mariela Morveli-Espinoza,&nbsp;Juan Carlos Nieves,&nbsp;Cesar Augusto Tacla","doi":"10.1007/s10472-023-09851-4","DOIUrl":null,"url":null,"abstract":"<div><p>The Bipolar Argumentation Framework approach is an extension of the Abstract Argumentation Framework. A Bipolar Argumentation Framework considers a support interaction between arguments, besides the attack interaction. As in the Abstract Argumentation Framework, some researches consider that arguments have a degree of uncertainty, which impacts on the degree of uncertainty of the extensions obtained from a Bipolar Argumentation Framework under a semantics. In these approaches, both the uncertainty of the arguments and of the extensions are modeled by means of precise probability values. However, in many real application domains there is a need for aggregating probability values from different sources so it is not suitable to aggregate such probability values in a unique probability distribution. To tackle this challenge, we use credal networks theory for modelling the uncertainty of the degree of belief of arguments in a BAF. We also propose an algorithm for calculating the degree of uncertainty of the extensions inferred by a given argumentation semantics. Moreover, we introduce the idea of modelling the support relation as a causal relation. We formally show that the introduced approach is sound and complete w.r.t the credal networks theory.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 4","pages":"517 - 536"},"PeriodicalIF":1.2000,"publicationDate":"2023-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09851-4.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Mathematics and Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10472-023-09851-4","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The Bipolar Argumentation Framework approach is an extension of the Abstract Argumentation Framework. A Bipolar Argumentation Framework considers a support interaction between arguments, besides the attack interaction. As in the Abstract Argumentation Framework, some researches consider that arguments have a degree of uncertainty, which impacts on the degree of uncertainty of the extensions obtained from a Bipolar Argumentation Framework under a semantics. In these approaches, both the uncertainty of the arguments and of the extensions are modeled by means of precise probability values. However, in many real application domains there is a need for aggregating probability values from different sources so it is not suitable to aggregate such probability values in a unique probability distribution. To tackle this challenge, we use credal networks theory for modelling the uncertainty of the degree of belief of arguments in a BAF. We also propose an algorithm for calculating the degree of uncertainty of the extensions inferred by a given argumentation semantics. Moreover, we introduce the idea of modelling the support relation as a causal relation. We formally show that the introduced approach is sound and complete w.r.t the credal networks theory.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
概率因果双极抽象论证:基于凭证网络的方法
两极论证框架方法是抽象论证框架的延伸。除了攻击交互作用外,双相论证框架还考虑了论据之间的支持交互作用。在抽象论证框架中,一些研究认为论证具有一定程度的不确定性,这影响了在语义下从两极论证框架获得的扩展的不确定性程度。在这些方法中,自变量和扩展的不确定性都是通过精确的概率值来建模的。然而,在许多实际应用领域中,需要聚合来自不同来源的概率值,因此不适合在唯一的概率分布中聚合这样的概率值。为了应对这一挑战,我们使用可信网络理论对BAF中论点的置信度的不确定性进行建模。我们还提出了一种算法来计算由给定论证语义推断的扩展的不确定性程度。此外,我们引入了将支持关系建模为因果关系的思想。我们正式证明了引入的方法是健全和完整的信用网络理论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence 工程技术-计算机:人工智能
CiteScore
3.00
自引率
8.30%
发文量
37
审稿时长
>12 weeks
期刊介绍: Annals of Mathematics and Artificial Intelligence presents a range of topics of concern to scholars applying quantitative, combinatorial, logical, algebraic and algorithmic methods to diverse areas of Artificial Intelligence, from decision support, automated deduction, and reasoning, to knowledge-based systems, machine learning, computer vision, robotics and planning. The journal features collections of papers appearing either in volumes (400 pages) or in separate issues (100-300 pages), which focus on one topic and have one or more guest editors. Annals of Mathematics and Artificial Intelligence hopes to influence the spawning of new areas of applied mathematics and strengthen the scientific underpinnings of Artificial Intelligence.
期刊最新文献
Time-penalised trees (TpT): introducing a new tree-based data mining algorithm for time-varying covariates Conformal test martingales for hypergraphical models Costly information providing in binary contests Tumato 2.0 - a constraint-based planning approach for safe and robust robot behavior Calibration methods in imbalanced binary classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1