Common knowledge in a logic of gossips

MaRDI QIDQ5016795zbMATH OpenFDO

Authors Krzysztof R. Apt, Dominik Wojtczak

Publication date 14 December 2021

Full work available at URL https://arxiv.org/abs/1707.08734, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TARK2017.2

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27)

Recommendations

• On decidability of a logic of gossips
• Verification of distributed epistemic gossip protocols
• When Are Two Gossips the Same?
• scientific article; zbMATH DE number 7440211

Cites work

• A simple account of multi-agent epistemic planning
• A survey of gossiping and broadcasting in communication networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Dynamic epistemic logic
• Epistemic protocols for dynamic gossip
• How to share knowledge by gossiping
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• scientific article; zbMATH DE number 7440211 (Why is no real title available?)
• scientific article; zbMATH DE number 6747860 (Why is no real title available?)
• On decidability of a logic of gossips

Cited in

(9)

• Propositional gossip protocols
• Minimal number of calls in propositional protocols
• On decidability of a logic of gossips
• The pleasure of gossip
• Verification of distributed epistemic gossip protocols
• Open problems in a logic of gossips
• scientific article; zbMATH DE number 6747860 (Why is no real title available?)
• The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable
• You can only be lucky once: optimal gossip for epistemic goals

This page was built for publication: Common knowledge in a logic of gossips

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016795)