协同知识

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2024-10-15 DOI:10.1016/j.tcs.2024.114902

Christian Cachin, David Lehnherr, Thomas Studer

{"title":"协同知识","authors":"Christian Cachin, David Lehnherr, Thomas Studer","doi":"10.1016/j.tcs.2024.114902","DOIUrl":null,"url":null,"abstract":"<div><div>Simplicial complexes are a successful model for distributed computing. They have recently been observed to provide an interesting model for epistemic multi-agent logic where the agents' local states are the main building blocks (instead of the global states). A natural generalization is to study epistemic logic on semi-simplicial sets. However, finding the appropriate modal logic for semi-simplicial models has been an open question. We answer this by introducing the logic of synergistic knowledge and establishing its soundness and completeness.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1023 ","pages":"Article 114902"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Synergistic knowledge\",\"authors\":\"Christian Cachin, David Lehnherr, Thomas Studer\",\"doi\":\"10.1016/j.tcs.2024.114902\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Simplicial complexes are a successful model for distributed computing. They have recently been observed to provide an interesting model for epistemic multi-agent logic where the agents' local states are the main building blocks (instead of the global states). A natural generalization is to study epistemic logic on semi-simplicial sets. However, finding the appropriate modal logic for semi-simplicial models has been an open question. We answer this by introducing the logic of synergistic knowledge and establishing its soundness and completeness.</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1023 \",\"pages\":\"Article 114902\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S030439752400519X\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S030439752400519X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

简单复合体是分布式计算的一个成功模型。最近，人们发现它们为多代理认识论逻辑提供了一个有趣的模型，其中代理的局部状态是主要的构建模块（而不是全局状态）。研究半简集合上的认识论逻辑是一种自然的概括。然而，为半简单模型寻找合适的模态逻辑一直是个未决问题。我们通过引入协同知识逻辑并建立其合理性和完备性来回答这个问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Synergistic knowledge

Simplicial complexes are a successful model for distributed computing. They have recently been observed to provide an interesting model for epistemic multi-agent logic where the agents' local states are the main building blocks (instead of the global states). A natural generalization is to study epistemic logic on semi-simplicial sets. However, finding the appropriate modal logic for semi-simplicial models has been an open question. We answer this by introducing the logic of synergistic knowledge and establishing its soundness and completeness.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.