20 citations · 86 across the 15 of their papers we have counts for
Showing 2008 · cs.CCShow all
2 papers · 2 filters
cs.CC2008
Generalized Modal Satisfiability
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
It is well known that modal satisfiability is PSPACE-complete (Ladner 1977). However, the complexity may decrease if we restrict the set of propositional operators used. Note that…
cs.CC2008★ 13 cited
On the Complexity of Elementary Modal Logics
Edith Hemaspaandra, Henning Schnoor
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b…