人口公告逻辑(PPAL)

Q3 Computer Science Electronic Notes in Theoretical Computer Science Pub Date : 2020-03-01 DOI:10.1016/j.entcs.2020.02.007

Vitor Machado , Mario Benevides

{"title":"人口公告逻辑(PPAL)","authors":"Vitor Machado , Mario Benevides","doi":"10.1016/j.entcs.2020.02.007","DOIUrl":null,"url":null,"abstract":"<div><p>Populational Announcement Logic (PPAL), is a variant of the standard Public Announcement Logic (PAL) with a fuzzy-inspired semantics, where instead of specific agents we have populations and groups. The semantics and the announcement logic are defined, and an example is provided. We show validities analogous to PAL axioms and their proofs, and also provide a proof of decidability. We briefly talk about model checking and compare the framework against probabilistic logic. We conclude that the main advantage of PPAL over PAL is the flexibility to work with previously defined agents.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"348 ","pages":"Pages 105-123"},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2020.02.007","citationCount":"0","resultStr":"{\"title\":\"Populational Announcement Logic (PPAL)\",\"authors\":\"Vitor Machado , Mario Benevides\",\"doi\":\"10.1016/j.entcs.2020.02.007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Populational Announcement Logic (PPAL), is a variant of the standard Public Announcement Logic (PAL) with a fuzzy-inspired semantics, where instead of specific agents we have populations and groups. The semantics and the announcement logic are defined, and an example is provided. We show validities analogous to PAL axioms and their proofs, and also provide a proof of decidability. We briefly talk about model checking and compare the framework against probabilistic logic. We conclude that the main advantage of PPAL over PAL is the flexibility to work with previously defined agents.</p></div>\",\"PeriodicalId\":38770,\"journal\":{\"name\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"348 \",\"pages\":\"Pages 105-123\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.entcs.2020.02.007\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571066120300074\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066120300074","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 0

摘要

人口公告逻辑(population Announcement Logic, PPAL)是标准公共公告逻辑(Public Announcement Logic, PAL)的一种变体，具有模糊启发的语义，其中我们使用人口和群体代替特定的代理。定义了语义和公告逻辑，并提供了一个示例。我们给出了类似PAL公理的有效性及其证明，并给出了可判定性的证明。我们简要地讨论了模型检查，并将框架与概率逻辑进行了比较。我们得出结论，与PAL相比，PPAL的主要优势是与先前定义的代理一起工作的灵活性。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Populational Announcement Logic (PPAL)

Populational Announcement Logic (PPAL), is a variant of the standard Public Announcement Logic (PAL) with a fuzzy-inspired semantics, where instead of specific agents we have populations and groups. The semantics and the announcement logic are defined, and an example is provided. We show validities analogous to PAL axioms and their proofs, and also provide a proof of decidability. We briefly talk about model checking and compare the framework against probabilistic logic. We conclude that the main advantage of PPAL over PAL is the flexibility to work with previously defined agents.

求助全文

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

来源期刊

Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)

自引率

0.00%

发文量

期刊介绍： ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.

期刊最新文献

Preface Murphree's Numerical Term Logic Tableaux A Note on Constructive Interpolation for the Multi-Modal Logic Km Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs