Characterizing Kripke structures in temporal logic
The International Joint Conference on theory and practice of software development on TAPSOFT '87
Reasoning about knowledge
Modal logic
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
On the Relation between Interpreted Systems and Kripke Models
Proceedings of the Workshops on Commonsense Reasoning, Intelligent Agents, and Distributed Artificial Intelligence: Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications
Dynamic Epistemic Logic
| Hi-index | 0.00 |
We explore when finite epistemic models are definable up to simulability or bisimulation, either over the basic multi-agent epistemic language L or over its extension LC with common knowledge operators. Our negative results are that: simulability is not definable in general in LC, and finite epistemic states (i.e., pointed models) are not definable up to bisimulation in L. Our positive results are that: finite epistemic states are definable up to bisimulation by model validity of L-formulas, and there is a class of epistemic models we call well-multifounded for which simulability is definable over L. From our method it also follows that finite epistemic models (i.e., not-pointed models) are definable up to bisimulation using model validity in L. Our results may prove useful for the logical specification of multi-agent systems, as it provides justification for the ubiquitous but often unjustified claims of the form 'suppose action a can only be performed in state s': we show when such preconditions exist. An application are characteristic formulae for interpreted systems. They have a special form wherein factual knowledge, positive knowledge, and ignorance can be separated.