Title :
Complexity transfer for modal logic
Author :
Hemaspaandra, Edith
Author_Institution :
Dept. of Comput. Sci., Le Moyne Coll., Syracuse, NY, USA
Abstract :
We prove general theorems about the relationship between the complexity of multi-modal logics and the complexity of their uni-modal fragments. Halpern and Moses (1985) show that the complexity of a multi-modal logic without any interaction between the modalities may be higher than the complexity of the individual fragments. We show that under reasonable assumptions the complexity can increase only if the complexity of all the uni-modal fragments is below PSPACE. In addition, we completely characterize what happens if the complexity of all fragments is below PSPACE
Keywords :
computational complexity; formal logic; theorem proving; PSPACE; complexity; complexity transfer; modal logic; multimodal logics; theorem proving; unimodal fragments; Computational linguistics; Computer science; Educational institutions; Logic; Upper bound;
Conference_Titel :
Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on
Conference_Location :
Paris
Print_ISBN :
0-8186-6310-3
DOI :
10.1109/LICS.1994.316074
