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
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
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
Modal probability, belief, and actions
Fundamenta Informaticae
Multi-Agent Dynamic Logics with Informational Test
Annals of Mathematics and Artificial Intelligence
Modeling Abstract Behavior: A Dynamic Logic Approach
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Reasoning about epistemic states of agents by modal logic programming
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Modal Probability, Belief, and Actions
Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
Hi-index | 0.00 |
This paper proposes a family of logics for reasoning about the dynamic activities and informational attitudes, i.e. the beliefs and knowledge, of agents. The logics are based on a new formalisations 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 the preservation of informativeness, truthfulness and belief are proved for a derivative of the informational test operator. It is shown that common belief and common knowledge can be expressed in these logics. As a consequence, these logics are more expressive than propositional dynamic logic with an extra modality for belief or knowledge. However, the logics are still decidable and in 2EXPTIME. Versions of the considered logics express natural additional properties of beliefs or knowledge and interaction of beliefs or knowledge with actions. A simulation of PDL is constructed in one of these extensions.