A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
What can machines know?: On the properties of knowledge in distributed systems
Journal of the ACM (JACM)
Reasoning about knowledge
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Combining Multiple Knowledge Bases
IEEE Transactions on Knowledge and Data Engineering
A Context-Based Logic for Distributed Knowledge Representation and Reasoning
CONTEXT '99 Proceedings of the Second International and Interdisciplinary Conference on Modeling and Using Context
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Answering Queries Addressed to Several Databases According to a Majority Merging Approach
Journal of Intelligent Information Systems
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Hi-index | 0.00 |
The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. A proposition A is distributed knowledge within a group G if A follows from the totality of what the individual members of G know. There are known axiomatizations for epistemic logics with the distributed knowledge operator, but apparently no cut-free proof system for such logics has yet been presented. A Gentzen-style contraction-free sequent calculus system for propositional epistemic logic with operators for distributed knowledge is given, and a cut-elimination theorem for the system is proved. Examples of reasoning about distributed knowledge that use the calculus are given.