Credulous acceptance in high-order argumentation frameworks with necessities: An incremental approach

IF 5.1 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Artificial Intelligence Pub Date : 2024-05-22 DOI:10.1016/j.artint.2024.104159
Gianvincenzo Alfano , Andrea Cohen , Sebastian Gottifredi , Sergio Greco , Francesco Parisi , Guillermo R. Simari
{"title":"Credulous acceptance in high-order argumentation frameworks with necessities: An incremental approach","authors":"Gianvincenzo Alfano ,&nbsp;Andrea Cohen ,&nbsp;Sebastian Gottifredi ,&nbsp;Sergio Greco ,&nbsp;Francesco Parisi ,&nbsp;Guillermo R. Simari","doi":"10.1016/j.artint.2024.104159","DOIUrl":null,"url":null,"abstract":"<div><p>Argumentation is an important research area in the field of AI. There is a substantial amount of work on different aspects of Dung's abstract Argumentation Framework (AF). Two relevant aspects considered separately so far are: <em>i</em>) extending the framework to account for recursive attacks and supports, and <span><math><mi>i</mi><mi>i</mi><mo>)</mo></math></span> considering dynamics, <em>i.e.</em>, AFs evolving over time. In this paper, we jointly deal with these two aspects. We focus on High-Order Argumentation Frameworks with Necessities (HOAFNs) which allow for attack and support relations (interpreted as <em>necessity</em>) not only between arguments but also targeting attacks and supports at any level. We propose an approach for the incremental evaluation of the credulous acceptance problem in HOAFNs, by “incrementally” computing an extension (a set of accepted arguments, attacks and supports), if it exists, containing a given goal element in an updated HOAFN. In particular, we are interested in monitoring the credulous acceptance of a given argument, attack or support (goal) in an evolving HOAFN. Thus, our approach assumes to have a HOAFN Δ, a goal <em>ϱ</em> occurring in Δ, an extension <em>E</em> for Δ containing <em>ϱ</em>, and an update <em>u</em> establishing some changes in the original HOAFN, and uses the extension for first checking whether the update is relevant; for relevant updates, an extension of the updated HOAFN containing the goal is computed by translating the problem to the AF domain and leveraging on AF solvers. We provide formal results for our incremental approach and empirically show that it outperforms the evaluation from scratch of the credulous acceptance problem for an updated HOAFN.</p></div>","PeriodicalId":8434,"journal":{"name":"Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":5.1000,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S000437022400095X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Argumentation is an important research area in the field of AI. There is a substantial amount of work on different aspects of Dung's abstract Argumentation Framework (AF). Two relevant aspects considered separately so far are: i) extending the framework to account for recursive attacks and supports, and ii) considering dynamics, i.e., AFs evolving over time. In this paper, we jointly deal with these two aspects. We focus on High-Order Argumentation Frameworks with Necessities (HOAFNs) which allow for attack and support relations (interpreted as necessity) not only between arguments but also targeting attacks and supports at any level. We propose an approach for the incremental evaluation of the credulous acceptance problem in HOAFNs, by “incrementally” computing an extension (a set of accepted arguments, attacks and supports), if it exists, containing a given goal element in an updated HOAFN. In particular, we are interested in monitoring the credulous acceptance of a given argument, attack or support (goal) in an evolving HOAFN. Thus, our approach assumes to have a HOAFN Δ, a goal ϱ occurring in Δ, an extension E for Δ containing ϱ, and an update u establishing some changes in the original HOAFN, and uses the extension for first checking whether the update is relevant; for relevant updates, an extension of the updated HOAFN containing the goal is computed by translating the problem to the AF domain and leveraging on AF solvers. We provide formal results for our incremental approach and empirically show that it outperforms the evaluation from scratch of the credulous acceptance problem for an updated HOAFN.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有必然性的高阶论证框架中的可信接受:渐进方法
论证是人工智能领域的一个重要研究领域。在 Dung 的抽象论证框架 (AF) 的不同方面已经开展了大量工作。迄今为止,分别考虑的两个相关方面是:i) 扩展该框架以考虑递归攻击和支持;ii) 考虑动态性,即论证框架随时间演变。在本文中,我们将联合处理这两个方面。我们将重点放在具有必要性的高阶论证框架(HOAFNs)上,它不仅允许论据之间存在攻击和支持关系(解释为必要性),而且还允许针对任何层次的攻击和支持。我们提出了一种在 HOAFNs 中增量评估可信接受问题的方法,即在更新的 HOAFN 中 "增量 "计算包含给定目标元素的扩展(一组已接受的论据、攻击和支持)(如果存在的话)。具体来说,我们感兴趣的是监控不断演化的 HOAFN 中给定论据、攻击或支持(目标)的可信接受度。因此,我们的方法假定有一个 HOAFN Δ、一个出现在 Δ 中的目标 ϱ、一个包含 ϱ 的 Δ 扩展 E 和一个在原始 HOAFN 中建立某些变化的更新 u,并使用扩展首先检查更新是否相关;对于相关更新,通过将问题转换到 AF 领域并利用 AF 求解器,计算出包含目标的更新 HOAFN 扩展。我们提供了增量方法的正式结果,并通过经验证明,该方法优于从头开始评估更新 HOAFN 的可信接受问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Artificial Intelligence
Artificial Intelligence 工程技术-计算机:人工智能
CiteScore
11.20
自引率
1.40%
发文量
118
审稿时长
8 months
期刊介绍: The Journal of Artificial Intelligence (AIJ) welcomes papers covering a broad spectrum of AI topics, including cognition, automated reasoning, computer vision, machine learning, and more. Papers should demonstrate advancements in AI and propose innovative approaches to AI problems. Additionally, the journal accepts papers describing AI applications, focusing on how new methods enhance performance rather than reiterating conventional approaches. In addition to regular papers, AIJ also accepts Research Notes, Research Field Reviews, Position Papers, Book Reviews, and summary papers on AI challenges and competitions.
期刊最新文献
Integration of memory systems supporting non-symbolic representations in an architecture for lifelong development of artificial agents Editorial Board PathLAD+: Towards effective exact methods for subgraph isomorphism problem Interval abstractions for robust counterfactual explanations Approximating problems in abstract argumentation with graph convolutional networks
×
引用
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