PSPACE Bounds for Rank-1 Modal Logics

aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descriptors: F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic—Modal Logic; Computational Logic; F.2.2. [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—Complexity of Proof Procedures General Terms: Algorithms, Languages, Theory Additional Key Words and Phrases: Shallow models, resolution, coalgebra

• Type: Conference
• Year: 2006
• Where: LICS
• Authors: Lutz Schröder, Dirk Pattinson
• Keywords: Additional Key Words, Computer Science, LICS 2006, Mathematical Logic—Modal Logic, Nonnumerical Algorithms