Topic-based communication between agents
From MaRDI portal
Cites work
- `Knowable' as `known after an announcement'
- A guide to completeness and complexity for modal logics of knowledge and belief
- Arbitrary arrow update logic
- Arrow update logic
- Axiomatising the logic of computer programming
- CCS expressions, finite state processes, and three problems of equivalence
- Coalition and relativised group announcement logic
- Distributed knowledge
- Dynamic epistemic logic
- Dynamic epistemic logic for budget-constrained agents
- Dynamic logic of preference upgrade
- Dynamics of lying
- Explaining games. The epistemic programme in game theory
- Group announcement logic
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 824735 (Why is no real title available?)
- scientific article; zbMATH DE number 3271001 (Why is no real title available?)
- Introspection as an action in relational models
- Knowledge and common knowledge in a distributed environment
- Learning what others know
- Logical dynamics of information and interaction
- Logics with group announcements and distributed knowledge: completeness and expressive power
- On axiomatizations of public announcement logic
- On the definability of simulation and bisimulation in epistemic logic
- Public announcement logic with distributed knowledge: expressivity, completeness and complexity
- Reasoning about information change
- Relation-changing modal operators
- Resolving distributed knowledge
- The Russian cards problem
- To be announced
- Verification and strategy synthesis for coalition announcement logic
- What can machines know?
This page was built for publication: Topic-based communication between agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6916902)
