Reasoning about knowledge
A spectrum of definitions for temporal model-based diagnosis
Artificial Intelligence
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
The logic of public announcements, common knowledge, and private suspicions
The logic of public announcements, common knowledge, and private suspicions
Reconstructing an Agent's Epistemic State from Observations about its Beliefs and Non-beliefs
Journal of Logic and Computation
Tableaux for Public Announcement Logic
Journal of Logic and Computation
Terminating Tableaux for Dynamic Epistemic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Belief extrapolation (or how to reason about observations and unpredicted change)
Artificial Intelligence
Tableau Method and NEXPTIME-Completeness of DEL-Sequents
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Let us consider a sequence of formulas providing partial information about an initial situation, about a set of events occurring sequentially in this situation, and about the resulting situation after the occurrence of each event. From this whole sequence, we want to infer more information, either about the initial situation, or about one of the events, or about the resulting situation after one of the events. Within the framework of Dynamic Epistemic Logic (DEL), we show that these different kinds of problems are all reducible to the problem of inferring what holds in the final situation after the occurrence of all the events. We then provide a tableau method deciding whether this kind of inference is valid. We implement it in LotrecScheme and show that these inference problems are NEXPTIME-complete. We extend our results to the cases where the accessibility relation is serial and reflexive and illustrate them with the coordinated attack problem.