Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Distributed Computing
Formal theories of knowledge in AI and robotics
New Generation Computing
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
The complexity of reasoning about knowledge and time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The synthesis of digital machines with provable epistemic properties
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Knowledge and common knowledge in a Byzantine environment I: crash failures
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Foundations of knowledge for distributed systems
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
The logic of distributed protocols
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
A knowledge-theoretic analysis of atomic commitment protocols
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Interpreting logics of knowledge in propositional dynamic logic with converse
Information Processing Letters
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Substituting for real time and common knowledge in asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
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
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Knowledge, common knowledge and related puzzles (Extended Summary)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
What can machines know?: On the properties of knowledge in distributed systems
Journal of the ACM (JACM)
Artificial Intelligence Review
Knowledge and communication: a first-order theory
Artificial Intelligence
Generalization of some properties of relations in the context of functional temporal×modal logic
International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering
Knowledge and communication: A first-order theory
Artificial Intelligence
Seeing, knowledge and common knowledge
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Interpreted systems semantics for process algebra with identity annotations
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
| Hi-index | 0.00 |
We investigate the complexity of reasoning about knowledge and time, with emphasis on the case of asynchronous time. We show that in the case of no forgetting (Ladner and Reif's Tree Logic of Protocols, TLP) the validity problem is complete for nonelementary time. This settles the open problem of [HV86, LR86]. This result is somewhat surprising in light of Ladner and Reif's undecidability result for a similar logic, LLP. We show that the undecidability result for LLP is caused by two quite natural properties of models in that logic, which we call no learning and unique initial state. Both of these properties are necessary for the undecidability result in [LR86]. We completely characterize the complexity of all ninety-six logics that result by varying the relevant parameters. Many of the results are quite delicate, and require substantially new techniques.