Fairness
A knowledge-theoretic analysis of atomic commitment protocols
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A characterization of eventual Byzantine agreement
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Using knowledge to optimally achieve coordination is distributed systems
TARK '92 Proceedings of the fourth conference on Theoretical aspects of reasoning about knowledge
Simulating synchronized clocks and common knowledge in distributed systems
Journal of the ACM (JACM)
Knowledge-oriented programming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Reasoning about knowledge
A formal model of knowledge, action, and communication in distributed systems: preliminary report
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A Link Between Knowledge and Communication in Faulty Distributed Systems
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge
Knowledge and the logic of local propositions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
A Refinement Theory that Supports Reasoning About Knowledge and Time
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Knowledge and the logic of local propositions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
| Hi-index | 0.00 |
We show how counterfactuals can be added to the framework of knowledge-based programs of Fagin, Halpern, Moses, and Vardi [1995, 1997]. We show that counter-factuals allow us to capture in a natural way notions like minimizing the number of messages that are sent, whereas attempts to formalize these notions without counterfactuals lead to some rather counterintuitive behavior. We also show how knowledge-based programs with counterfactuals can capture subgame-perfect equilibria in games of perfect information.