The Complexity of Reasoning with Boolean Modal Logics
RWTH Aachen, LuFg Theoretical Computer Science, Carsten Lutz, Ulrike Sattler, RWTH Aachen, LuFg Theoretical Computer Science · 2000
Since Modal Logics are an extension of Propositional Logic, they provide Boolean operators for constructing complex formulae. However, most Modal Logics do not admit Boolean operators for constructing complex modal parameters to be used in the box and diamond operators. This asymmetry is not present in Boolean Modal Logics, in which box and diamond quantify over arbitrary Boolean combinations of atomic model parameters.