A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

@article{Kazakov2009ANO,
  title={A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics},
  author={Yevgeny Kazakov and Ian Pratt-Hartmann},
  journal={2009 24th Annual IEEE Symposium on Logic In Computer Science},
  year={2009},
  pages={407-416}
}
Graded modal logic is the formal language obtained from ordinary modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive interpretations such as "It is true at no fewer than 15 accessible worlds that...", or "It is true at no more than 2 accessible worlds that...". We investigate the complexity of satisfiability for this language over some familiar classes of frames. This problem is more… CONTINUE READING