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
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
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
Simulating synchronized clocks and common knowledge in distributed systems
Journal of the ACM (JACM)
Reasoning about knowledge
Modeling belief in dynamic systems, part I: foundations
Artificial Intelligence
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
Causality: models, reasoning, and inference
Causality: models, reasoning, and inference
A Characterization of Eventual Byzantine Agreement
SIAM Journal on 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
Journal of Artificial Intelligence Research
Characterizing solution concepts in games using knowledge-based programs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
From knowledge-based programs to graded belief-based programs, part II: off-line reasoning
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A knowledge-based analysis of global function computation
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Hi-index | 0.00 |
This paper adds counterfactuals to the framework of knowledge-based programs of Fagin, Halpern, Moses, and Vardi [3,4]. The use of counterfactuals is illustrated by designing a protocol in which an agent stops sending messages once it knows that it is safe to do so. Such behavior is difficult to capture in the original framework because it involves reasoning about counterfactual executions, including ones that are not consistent with the protocol. Attempts to formalize these notions without counterfactuals are shown to lead to rather counterintuitive behavior.