Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
| dc.creator | Halpern, Joseph Y. | |
| dc.creator | Rego, Leandro Chaves | |
| dc.date | 2006-03-05 | |
| dc.date.accessioned | 2026-07-07T07:05:47Z | |
| dc.date.available | 2026-07-07T07:05:47Z | |
| dc.description | There has been a great of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the validity problem for all logics between K, T, and S4 is {\sl PSPACE}-complete, while for S5 it is {\sl NP}-complete. We show that, in a precise sense, it is \emph{negative introspection}, the axiom $\neg K p \rimp K \neg K p$, that causes the gap. In a precise sense, if we require this axiom, then the satisfiability problem is {\sl NP}-complete; without it, it is {\sl PSPACE}-complete. | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0603019 | |
| dc.identifier | http://arxiv.org/abs/cs/0603019 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/109788 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Computational Complexity | |
| dc.title | Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic | |
| dc.type | text |