Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Knowledge and implicit knowledge in a distributed environment
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
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)
Handbook of logic in artificial intelligence and logic programming (vol. 1)
Reasoning about knowledge
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Single Step Tableaux for Modal Logics
Journal of Automated Reasoning
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Distributed Computing
Decision procedure for a fragment of mutual belief logic with quantified agent variables
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
| Hi-index | 0.00 |
A transitive distributed knowledge logic is considered. The considered logic S4 nD is obtained from multi-modal logic S4 n by adding transitive distributed knowledge operator. For a fragment of this logic loop-check-free sequent calculus is proposed. The considered fragment is such that it can be applied for specification and verification of safety properties of knowledge-based distributed systems. By relying on the constructed loop-check-free sequent calculus a PSPACE procedure to determine a termination of backward derivation in considered fragment of the logic S4 nD is presented.