Modeling and shadowing paraconsistent BDI agents

IF 1.2 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Annals of Mathematics and Artificial Intelligence Pub Date : 2023-11-23 DOI:10.1007/s10472-023-09902-w
Barbara Dunin-Kęplicz, Andrzej Szałas
{"title":"Modeling and shadowing paraconsistent BDI agents","authors":"Barbara Dunin-Kęplicz,&nbsp;Andrzej Szałas","doi":"10.1007/s10472-023-09902-w","DOIUrl":null,"url":null,"abstract":"<div><p>The <span>Bdi</span> model of rational agency has been studied for over three decades. Many robust multiagent systems have been developed, and a number of <span>Bdi</span> logics have been studied. Following this intensive development phase, the importance of integrating <span>Bdi</span> models with inconsistency handling and revision theory have been emphasized. There is also a demand for a tighter connection between <span>Bdi</span>-based implementations and <span>Bdi</span> logics. In this paper, we address these postulates by introducing a novel, paraconsistent logical <span>Bdi</span> model close to implementation, with building blocks that can be represented as <span>Sql</span>/rule-based databases. Importantly, tractability is achieved by reasoning as querying. This stands in a sharp contrast to the high complexity of known <span>Bdi</span> logics. We also extend belief shadowing, a shallow and lightweight alternative to deep and computationally demanding belief revision, to encompass agents’ motivational attitudes.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 4","pages":"855 - 876"},"PeriodicalIF":1.2000,"publicationDate":"2023-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09902-w.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-09902-w","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 Bdi model of rational agency has been studied for over three decades. Many robust multiagent systems have been developed, and a number of Bdi logics have been studied. Following this intensive development phase, the importance of integrating Bdi models with inconsistency handling and revision theory have been emphasized. There is also a demand for a tighter connection between Bdi-based implementations and Bdi logics. In this paper, we address these postulates by introducing a novel, paraconsistent logical Bdi model close to implementation, with building blocks that can be represented as Sql/rule-based databases. Importantly, tractability is achieved by reasoning as querying. This stands in a sharp contrast to the high complexity of known Bdi logics. We also extend belief shadowing, a shallow and lightweight alternative to deep and computationally demanding belief revision, to encompass agents’ motivational attitudes.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
建模和跟踪不一致的BDI代理
理性代理的Bdi模型已经被研究了三十多年。已经开发了许多健壮的多智能体系统,并且研究了许多Bdi逻辑。在这个密集的开发阶段之后,强调了将Bdi模型与不一致处理和修订理论集成的重要性。还需要在基于Bdi的实现和Bdi逻辑之间建立更紧密的连接。在本文中,我们通过引入一种接近实现的新颖的、准一致的逻辑Bdi模型来解决这些假设,该模型具有可以表示为基于Sql/规则的数据库的构建块。重要的是,可追溯性是通过推理作为查询来实现的。这与已知Bdi逻辑的高复杂性形成鲜明对比。我们还扩展了信念阴影,这是一种浅而轻的替代深度和计算要求的信念修正,以包含代理的动机态度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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