The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Computing
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)
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
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Using knowledge to optimally achieve coordination is distributed systems
TARK '92 Proceedings of the fourth conference on Theoretical aspects of reasoning about knowledge
Reasoning about infinite computations
Information and Computation
Reasoning about knowledge
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Knowledge as a tool in motion planning under uncertainty
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Common knowledge and consistent simultaneous coordination
Distributed Computing
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking Knowledge and Linear Time: PSPACE Cases
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
QBF-based symbolic model checking for knowledge and time
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Knowledge-Based Asynchronous Programming
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
| Hi-index | 0.00 |
Reasoning about multi-agents systems at the knowledge level allows us to abstract away from many concrete details of the systems we are considering. Fagin et al. introduced two notions to facilitate designing and reasoning about systems in terms of knowledge. The first notion is that of knowledge-based programs. Knowledge-based programs are defined as syntactic objects: programs with tests for knowledge. The second notion is that of contexts, which capture the setting in which a program is to be executed. In a given context, a standard program (one without tests for knowledge) is always implementable. A knowledge-based program, on the other hand, might not be implementable. We provide a condition which is necessary and sufficient to guarantee that a given knowledge-based program is implemented by a given protocol, and we completely characterize the complexity of determining whether a given knowledge-based program is implemented by a given protocol in a given finite-state context. In particular, we identify an important special case where this problem is tractable.