Topic-Based Communication Between Agents

IF 0.6 3区 数学 Q2 LOGIC
Rustam Galimullin, Fernando R. Velázquez-Quesada
{"title":"Topic-Based Communication Between Agents","authors":"Rustam Galimullin, Fernando R. Velázquez-Quesada","doi":"10.1007/s11225-024-10119-z","DOIUrl":null,"url":null,"abstract":"<p>Communication within groups of agents has been lately the focus of research in dynamic epistemic logic. This paper studies a recently introduced form of <i>partial</i> (more precisely, <i>topic-based</i>) <i>communication</i>. This type of communication allows for modelling scenarios of multi-agent collaboration and negotiation, and it is particularly well-suited for situations in which sharing all information is not feasible/advisable. The paper can be divided into two parts. In the first part, we present results on invariance and complexity of model checking. Moreover, we compare partial communication with the public announcement and arrow update settings in terms of both language-expressivity and update-expressivity. Regarding the former, the three settings are equivalent, their languages being equally expressive. Regarding the latter, all three modes of communication are incomparable in terms of update-expressivity. In the second part, we shift our attention to <i>strategic</i> topic-based communication. We do so by extending the language with a modality that quantifies over the topics the agents can ‘talk about’, thus allowing a form of <i>arbitrary partial communication</i>. For this new framework, we provide a complete axiomatisation, showing also that the new language’s model checking problem is <i>PSPACE</i>-complete. Finally, we argue that, in terms of expressivity, this new language of arbitrary partial communication is incomparable to that of arbitrary public announcements and also to that of arbitrary arrow updates.</p>","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"31 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studia Logica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11225-024-10119-z","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

Abstract

Communication within groups of agents has been lately the focus of research in dynamic epistemic logic. This paper studies a recently introduced form of partial (more precisely, topic-based) communication. This type of communication allows for modelling scenarios of multi-agent collaboration and negotiation, and it is particularly well-suited for situations in which sharing all information is not feasible/advisable. The paper can be divided into two parts. In the first part, we present results on invariance and complexity of model checking. Moreover, we compare partial communication with the public announcement and arrow update settings in terms of both language-expressivity and update-expressivity. Regarding the former, the three settings are equivalent, their languages being equally expressive. Regarding the latter, all three modes of communication are incomparable in terms of update-expressivity. In the second part, we shift our attention to strategic topic-based communication. We do so by extending the language with a modality that quantifies over the topics the agents can ‘talk about’, thus allowing a form of arbitrary partial communication. For this new framework, we provide a complete axiomatisation, showing also that the new language’s model checking problem is PSPACE-complete. Finally, we argue that, in terms of expressivity, this new language of arbitrary partial communication is incomparable to that of arbitrary public announcements and also to that of arbitrary arrow updates.

代理之间基于主题的交流
近来,代理群体内部的交流一直是动态认识论逻辑的研究重点。本文研究的是最近引入的一种部分(更准确地说,是基于主题的)交流形式。这种交流方式可以模拟多代理协作和协商的情景,尤其适合于无法/不宜共享所有信息的情况。本文可分为两部分。在第一部分,我们介绍了模型检查的不变性和复杂性。此外,我们还从语言可执行性和更新可执行性两方面,比较了部分通信与公开声明和箭头更新设置。就前者而言,三种设置是等价的,它们的语言表达能力相同。就后者而言,所有三种交流模式在更新表达性方面都不可同日而语。在第二部分中,我们将注意力转移到基于话题的战略交流上。为此,我们扩展了语言的模态,对代理可以 "谈论 "的话题进行量化,从而允许一种任意的部分交流形式。对于这个新框架,我们提供了一个完整的公理化,并证明新语言的模型检查问题是 PSPACE-完备的。最后,我们认为,就表达能力而言,这一新的任意部分交流语言与任意公告语言和任意箭头更新语言是不可比拟的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Studia Logica
Studia Logica MATHEMATICS-LOGIC
CiteScore
1.70
自引率
14.30%
发文量
43
审稿时长
6-12 weeks
期刊介绍: The leading idea of Lvov-Warsaw School of Logic, Philosophy and Mathematics was to investigate philosophical problems by means of rigorous methods of mathematics. Evidence of the great success the School experienced is the fact that it has become generally recognized as Polish Style Logic. Today Polish Style Logic is no longer exclusively a Polish speciality. It is represented by numerous logicians, mathematicians and philosophers from research centers all over the world.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信