On Decidability of a Logic of Gossips

DOI10.1007/978-3-319-48758-8_2zbMath1484.68226OpenAlexW2543474544MaRDI QIDQ2835859

Dominik Wojtczak, Krzysztof R. Apt

Publication date: 30 November 2016

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/25028

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Decidability of theories and sets of sentences (03B25) Agent technology and artificial intelligence (68T42)

Related Items (4)

Propositional gossip protocols ⋮ Minimal number of calls in propositional protocols ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of gossiping and broadcasting in communication networks
• A little knowledge goes a long way
• How to share knowledge by gossiping
• Knowledge-based programs
• CONCUR 2005 – Concurrency Theory

This page was built for publication: On Decidability of a Logic of Gossips