Reasoning about knowledge
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Idempotent Transductions for Modal Logics
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Knowledge forgetting: Properties and applications
Artificial Intelligence
On the progression of knowledge in the situation calculus
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
| Hi-index | 0.00 |
In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D'Agostino and Hollenberg, 2000), intuitionistic logic (Pitts, 1992) and logics of knowledge (French 2003). We investigate the properties of bisimulation quantifiers in general modal logics, particularly the expressivity and decidability, and seek to motivate the use of bisimulation quantified modal logics. This paper addresses two important questions: when are bisimulation quantified logics bisimulation invariant; and do bisimulation quantifiers always preserve decidability? We provide a sufficient condition for bisimulation invariance, and give two examples of decidable modal logics which are undecidable when augmented with bisimulation quantifiers. This is part of a program of study to characterize the expressivity and decidability of bisimulation quantified modal logics.