“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Handbook of theoretical computer science (vol. B)
Belief as defeasible knowledge
Artificial Intelligence
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Reasoning about knowledge
Reasoning about knowledge: a survey
Handbook of logic in artificial intelligence and logic programming (Vol. 4)
Alternating-time temporal logic
Journal of the ACM (JACM)
Verifying epistemic properties of multi-agent systems via bounded model checking
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Probabilistic Dynamic Epistemic Logic
Journal of Logic, Language and Information
A knowledge-based framework for belief change part I: foundations
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
A computationally grounded logic of knowledge, belief and certainty
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
A framework for reasoning about rational agents
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Intentions and strategies in game-like scenarios
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
A framework for reasoning about rational agents
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A Logic for Reasoning about Rational Agents
Computational Logic in Multi-Agent Systems
Reasoning about temporal properties of rational play
Annals of Mathematics and Artificial Intelligence
Rational play and rational beliefs under uncertainty
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Verifying agents with memory is harder than it seemed
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
Hi-index | 0.00 |
Logics of knowledge and belief are often too static and inflexible to be used on real-world problems. In particular, they usually offer no concept for expressing that some course of events is more likely to happen than another. We address this problem and extend CTLK (computation tree logic with knowledge) with a notion of plausibility, which allows for practical and counterfactual reasoning. The new logic CTLKP (CTLK with plausibility) includes also a particular notion of belief. A plausibility update operator is added to this logic in order to change plausibility assumptions dynamically. Furthermore, we examine some important properties of these concepts. In particular, we show that, for a natural class of models, belief is a KD45 modality. We also show that model checking CTLKP is PTIME-complete and can be done in time linear with respect to the size of models and formulae.