Verification and strategy synthesis for coalition announcement logic
From MaRDI portal
Publication:2071573
Recommendations
Cites work
- `Knowable' as `known after an announcement'
- A Modal Logic for Coalitional Power in Games
- Computer Aided Verification
- Group announcement logic
- Handbook of modal logic
- scientific article; zbMATH DE number 3880483 (Why is no real title available?)
- scientific article; zbMATH DE number 5734950 (Why is no real title available?)
- scientific article; zbMATH DE number 5064947 (Why is no real title available?)
- Logic in games
- Logics of public communications
- Modal logic
- Model Checking for Coalition Announcement Logic
- On the definability of simulation and bisimulation in epistemic logic
- Positive announcements
- Resolving distributed knowledge
- Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond*
- The Russian cards problem
- The secret of my success
- The undecidability of quantified announcements
- Three Partition Refinement Algorithms
- What will they say? -- Public announcement games
Cited in
(6)- Logics with group announcements and distributed knowledge: completeness and expressive power
- Model checking for coalition announcement logic
- Model Checking for Coalition Announcement Logic
- Topic-based communication between agents
- Epistemic skills: logical dynamics of knowing and forgetting
- Epistemic skills: reasoning about knowledge and oblivion
This page was built for publication: Verification and strategy synthesis for coalition announcement logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2071573)