How to share knowledge by gossiping

DOI10.3233/AIC-170723MaRDI QIDQ4589265zbMATH OpenOpenAlexFDO

Authors Andreas Herzig, Faustine Maffre

Publication date 10 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-170723

zbMATH Keywords

observabilitycommon knowledgedynamic epistemic logicepistemic logicvisibilitytheory of mindgossip protocolshared knowledge

Mathematics Subject Classification ID

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

Recommendations

• The epistemic gossip problem
• When Are Two Gossips the Same?
• The logic of gossiping
• scientific article; zbMATH DE number 6747860
• scientific article; zbMATH DE number 7440211

Cited in

(16)

• When Are Two Gossips the Same?
• The epistemic gossip problem
• The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable
• Propositional gossip protocols
• Possible worlds semantics based on observation and communication
• Dynamic epistemic logics: promises, problems, shortcomings, and perspectives
• The logic of gossiping
• On decidability of a logic of gossips
• Common knowledge in a logic of gossips
• How to discreetly spread a rumor in a crowd
• You can only be lucky once: optimal gossip for epistemic goals
• Will any gossip do? Gossip does not need to be perfectly accurate to promote trust
• Minimal number of calls in propositional protocols
• scientific article; zbMATH DE number 6747860 (Why is no real title available?)
• The pleasure of gossip
• scientific article; zbMATH DE number 7450017 (Why is no real title available?)

This page was built for publication: How to share knowledge by gossiping

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