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

Yevgeny Kazakov, Ian Pratt-Hartmann. A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. In Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA. pages 407-416, IEEE Computer Society, 2009. [doi]

@inproceedings{KazakovP09,
  title = {A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics},
  author = {Yevgeny Kazakov and Ian Pratt-Hartmann},
  year = {2009},
  doi = {10.1109/LICS.2009.17},
  url = {http://dx.doi.org/10.1109/LICS.2009.17},
  tags = {modal logic, logic},
  researchr = {https://researchr.org/publication/KazakovP09},
  cites = {0},
  citedby = {0},
  pages = {407-416},
  booktitle = {Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-3746-7},
}