The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic

@article{Halpern1995TheEO,
  title={The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic},
  author={Joseph Y. Halpern},
  journal={Artif. Intell.},
  year={1995},
  volume={75},
  pages={361-372}
}
A well-known result of Ladner says that the satissability problem for K45, KD45, and S5 is NP-complete. This result implicitly assumes that there are innnitely many primitive propositions in the language; it is easy to see that the satissability problem for these logics becomes linear time if there are only nitely many primitive propositions in the language. By way of contrast, we show that the PSPACE-completness results of Ladner and Halpern and Moses hold for the modal logics if there is only… CONTINUE READING
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.
76 Citations
8 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

A guide to completeness and complexity for modal logicsof knowledge and belief

  • Y. Moses
  • Arti cial Intelligence
  • 1992
Highly Influential
14 Excerpts

1968).An Introduction to Modal Logic. London: Methuen

  • G. E. Hughes, M. J. Cresswell
  • 1968
Highly Influential
8 Excerpts

Modal Logic

  • B. F. Chellas
  • Cambridge, U.K.: Cambridge University Press.
  • 1980
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…