A Deduction Model of Belief
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Complete and Decidable Logic for Resource-Bounded Agents
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Epistemic Logic for Rule-Based Agents
Journal of Logic, Language and Information
Hi-index | 0.00 |
We present a general logic of explicit knowledge represented as finite sets of logical formulae which can evolve by non-deterministic reasoning and communication. It is partly based on Alternating-time Temporal Logic, which allows the expression of properties of cooperation. Properties of an agent's reasoning mechanism such as "the agent knows modus ponens" can be expressed. Instead of a common closure condition such as "if the agent knows both p and p → q, he must also know q", the following holds: "if the agent knows p, p → q and modus ponens, he has a strategy to get to know q in the future".