The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Reasoning about knowledge
Agent technology: foundations, applications, and markets
Agent technology: foundations, applications, and markets
Formalising abilities and opportunities of agents
Fundamenta Informaticae
A logical approach to the dynamics of commitments
Artificial Intelligence
Knowledge in multiagent systems: initial configurations and broadcast
ACM Transactions on Computational Logic (TOCL)
Modal logic
Dynamic Logic
Logical foundations of agent-based computing
Mutli-agents systems and applications
Multi-agent Logics of Dynamic Belief and Knowledge
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
A Logic for Planning under Partial Observability
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A framework to compute inference rules valid in agents' temporal logics
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Inference rules in multi-agents' temporal logics
Transactions on computational collective intelligence IV
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
This paper investigates a family of logics for reasoning about the dynamic activities and informational attitudes of agents, namely the agents' beliefs and knowledge. The logics are based on a new formalisation and semantics of the test operator of propositional dynamic logic and a representation of actions which distinguishes abstract actions from concrete actions. The new test operator, called informational test, can be used to formalise the beliefs and knowledge of particular agents as dynamic modalities. This approach is consistent with the formalisation of the agents' beliefs and knowledge as K(D)45 and S5 modalities. Properties concerning informativeness, truthfulness and preservation of beliefs are proved for a derivative of the informational test operator. It is shown that common belief and common knowledge can be expressed in the considered logics. This means, the logics are more expressive than propositional dynamic logic with an extra modality for belief or knowledge. The logics remain decidable and belong to 2EXPTIME. Versions of the considered logics express natural additional properties of beliefs or knowledge and interaction of beliefs or knowledge with actions. It is shown that a simulation of PDL can be constructed in one of these extensions.